A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes-Reference-Cited by-同舟云学术

A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes

Published:2018-06-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Grandoni Fabrizio¹,Mömke Tobias²,Wiese Andreas³,Zhou Hang⁴

Affiliation:

1. University of Lugano, Switzerland

2. University of Bremen, Germany / Saarland University, Germany

3. University of Chile, Chile

4. École Polytechnique, France

Funder

Lise Meitner Award Fellowship

SNSF

European Research Council (ERC)

German Research Foundation (DFG)

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3188745.3188894

Reference29 articles.

1. Anna Adamaszek Parinya Chalermsook Alina Ene and Andreas Wiese. 2016. Anna Adamaszek Parinya Chalermsook Alina Ene and Andreas Wiese. 2016.

2. Aris Anagnostopoulos Fabrizio Grandoni Stefano Leonardi and Andreas Wiese. 2013. Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. In IPCO. 25–36. 3- 642- 36694- 9_3 10.1007/978-3-642-36694-9_3 Aris Anagnostopoulos Fabrizio Grandoni Stefano Leonardi and Andreas Wiese. 2013. Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. In IPCO. 25–36. 3- 642- 36694- 9_3 10.1007/978-3-642-36694-9_3

3. Aris Anagnostopoulos Fabrizio Grandoni Stefano Leonardi and Andreas Wiese. 2014. A Mazing 2+ ε Approximation for Unsplittable Flow on a Path. In SODA. 26–41. Aris Anagnostopoulos Fabrizio Grandoni Stefano Leonardi and Andreas Wiese. 2014. A Mazing 2+ ε Approximation for Unsplittable Flow on a Path. In SODA. 26–41.

4. Scheduling jobs with fixed start and end times

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms;Discrete Applied Mathematics;2024-12

2. Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem;European Journal of Operational Research;2024-08

3. Peak Demand Minimization via Sliced Strip Packing;Algorithmica;2023-07-27

4. Approximations for generalized unsplittable flow on paths with application to power systems optimization;Annals of Operations Research;2022-11-07

5. A PTAS for unsplittable flow on a path;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09