No. Title Author Year
1 Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime Friggstad, Zachary et al. 2021
2 A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time Friggstad, Zachary et al. 2020
3 Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs Ahmadian, Sara et al. 2017
4 Scheduling Problems over Network of Machines Friggstad, Zachary et al. 2017
5 A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs Friggstad, Zachary et al. 2016
6 Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding Friggstad, Zachary et al. 2016
7 Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median Friggstad, Zachary et al. 2016
8 On Linear Programming Relaxations for Unsplittable Flow in Trees Friggstad, Zachary et al. 2015
9 Approximation Algorithms for Minimum-Load k-Facility Location Ahmadian, Sara et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI