No. |
Title |
Author |
Year |
---|

1 |
Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters |
Friggstad, Zachary et al. |
2022 |

2 |
Constant-Factor Approximation to Deadline TSP and Related Problems in (Almost) Quasi-Polytime |
Friggstad, Zachary et al. |
2021 |

3 |
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time |
Friggstad, Zachary et al. |
2020 |

4 |
Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs |
Ahmadian, Sara et al. |
2017 |

5 |
Scheduling Problems over Network of Machines |
Friggstad, Zachary et al. |
2017 |

6 |
A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs |
Friggstad, Zachary et al. |
2016 |

7 |
Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding |
Friggstad, Zachary et al. |
2016 |

8 |
Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median |
Friggstad, Zachary et al. |
2016 |

9 |
On Linear Programming Relaxations for Unsplittable Flow in Trees |
Friggstad, Zachary et al. |
2015 |

10 |
Approximation Algorithms for Minimum-Load k-Facility Location |
Ahmadian, Sara et al. |
2014 |