Fabrizio Grandoni
ABSTRACT
In the Unsplittable Flow on a Path problem (UFP) we are given a path with edge capacities, and a set of tasks where each task is characterized by a subpath, a demand, and a weight. The goal is to select a subset of tasks of maximum total weight such that the total demand of the selected tasks using each edge e is at most the capacity of e. The problem admits a QPTAS [Bansal, Chakrabarti, Epstein, Schieber, STOC'06; Batra, Garg, Kumar, Mömke, Wiese, SODA'15]. After a long sequence of improvements [Bansal, Friggstad, Khandekar, Salavatipour, SODA'09; Bonsma, Schulz, Wiese, FOCS'11; Anagnostopoulos, Grandoni, Leonardi, Wiese, SODA'14; Grandoni, Mömke, Wiese, Zhou, STOC'18], the best known polynomial time approximation algorithm for UFP has an approximation ratio of 1+1/(e+1) + epsilon < 1.269 [Grandoni, Mömke, Wiese, SODA'22]. It has been an open question whether this problem admits a PTAS. In this paper, we solve this open question and present a polynomial time (1 + epsilon)-approximation algorithm for UFP.
- Anna Adamaszek, Parinya Chalermsook, Alina Ene, and Andreas Wiese. 2016. Submodular Unsplittable Flow on Trees. In IPCO (Lecture Notes in Computer Science, Vol. 9682). 337–349. https://doi.org/10.1007/978-3-319-33461-5_28 Google Scholar
Digital Library
- Anna Adamaszek and Andreas Wiese. 2013. Approximation schemes for maximum weight independent set of rectangles. In Foundations of Computer Science (FOCS), 2013 IEEE 54 th Annual Symposium on. 400–409.Google ScholarDigital Library
- 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. https://doi.org/10.1007/978-3-642-36694-9_3 Google ScholarDigital Library
- Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, and Andreas Wiese. 2014. A Mazing 2+ε Approximation for Unsplittable Flow on a Path. In SODA. 26–41.Google Scholar
- N. Bansal, A. Chakrabarti, A. Epstein, and B. Schieber. 2006. A quasi-PTAS for unsplittable flow on line graphs. In STOC. ACM, 721–729.Google Scholar
- N. Bansal, Z. Friggstad, R. Khandekar, and R. Salavatipour. 2009. A logarithmic approximation for unsplittable flow on line graphs. In SODA. 702–709.Google Scholar
- A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber. 2000. A unified approach to approximating resource allocation and scheduling. In STOC. 735–744.Google Scholar
- R. Bar-Yehuda, M. Beder, Y. Cohen, and D. Rawitz. 2006. Resource Allocation in Bounded Degree Trees. In ESA. 64–75.Google Scholar
- Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, and Dror Rawitz. 2009. Resource allocation in bounded degree trees. Algorithmica, 54, 1 (2009), 89–106.Google ScholarDigital Library
- Reuven Bar-Yehuda, Michael Beder, and Dror Rawitz. 2017. A Constant Factor Approximation Algorithm for the Storage Allocation Problem. Algorithmica, 77, 4 (2017), 1105–1127. https://doi.org/10.1007/s00453-016-0137-8 Google ScholarDigital Library
- Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mömke, and Andreas Wiese. 2015. New Approximation Schemes for Unsplittable Flow on a Path. In SODA. 47–58. https://doi.org/10.1137/1.9781611973730.5 arxiv:http://epubs.siam.org/doi/pdf/10.1137/1.9781611973730.5. Google ScholarCross Ref
- Paul Bonsma, Jens Schulz, and Andreas Wiese. 2014. A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths. SIAM J. Comput., 43 (2014), 767–799.Google ScholarCross Ref
- Gruia Călinescu, Amit Chakrabarti, Howard J. Karloff, and Yuval Rabani. 2011. An improved approximation algorithm for resource allocation. ACM Transactions on Algorithms, 7 (2011), Article 48, 48:1–48:7 pages. issn:1549-6325 https://doi.org/10.1145/2000807.2000816 Google ScholarDigital Library
- Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Shalmoli Gupta, Sambuddha Roy, and Yogish Sabharwal. 2014. Improved Algorithms for Resource Allocation under Varying Capacity. In ESA. 222–234.Google Scholar
- A. Chakrabarti, C. Chekuri, A. Gupta, and A. Kumar. 2007. Approximation Algorithms for the Unsplittable Flow Problem.. Algorithmica, 47 (2007), 53–78.Google ScholarCross Ref
- Parinya Chalermsook. 2011. Coloring and maximum independent set of rectangles. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 123–134.Google Scholar
- P. Chalermsook and J. Chuzhoy. 2009. Maximum independent set of rectangles. In Proceedings of the 20 th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’09). SIAM, 892–901.Google Scholar
- C. Chekuri, A. Ene, and N. Korula. 2009. Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. In APPROX-RANDOM. 42–55.Google Scholar
- C. Chekuri, M. Mydlarz, and F. Shepherd. 2007. Multicommodity demand flow in a tree and packing integer programs. ACM Transactions on Algorithms, 3 (2007).Google Scholar
- B. Chen, R. Hassin, and M. Tzur. 2002. Allocation of bandwidth and storage. IIE Transactions, 34 (2002), 501–507.Google ScholarCross Ref
- M. Chrobak, G. Woeginger, K. Makino, and H. Xu. 2010. Caching Is Hard, Even in the Fault Model. In ESA. 195–206.Google Scholar
- Julia Chuzhoy and Alina Ene. 2016. On Approximating Maximum Independent Set of Rectangles. In IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, Irit Dinur (Ed.). IEEE Computer Society, 820–829. https://doi.org/10.1109/FOCS.2016.92 Google ScholarCross Ref
- A. Darmann, U. Pferschy, and J. Schauer. 2010. Resource allocation with time intervals. Theoretical Computer Science, 411 (2010), 4217–4234.Google ScholarDigital Library
- Zachary Friggstad and Zhihan Gao. 2015. On Linear Programming Relaxations for Unsplittable Flow in Trees. In APPROX-RANDOM (LIPIcs, Vol. 40). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 265–283.Google Scholar
- Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, and Andreas Wiese. 2021. A (2+∊ )-Approximation Algorithm for Maximum Independent Set of Rectangles. CoRR, abs/2106.00623 (2021), arXiv:2106.00623. arxiv:2106.00623Google Scholar
- Fabrizio Grandoni, Salvatore Ingala, and Sumedha Uniyal. 2015. Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows. In WAOA. 13–24.Google Scholar
- Fabrizio Grandoni, Tobias Mömke, and Andreas Wiese. 2021. Faster (1+∊ )-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. In 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference), Petra Mutzel, Rasmus Pagh, and Grzegorz Herman (Eds.) (LIPIcs, Vol. 204). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 49:1–49:15. https://doi.org/10.4230/LIPIcs.ESA.2021.49 Google ScholarCross Ref
- Fabrizio Grandoni, Tobias Mömke, and Andreas Wiese. 2022. Unsplittable Flow on a Path: The Game!. In SODA.Google Scholar
- Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, and Hang Zhou. 2017. To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. In SODA. 2411–2422.Google Scholar
- Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, and Hang Zhou. 2018. A (5/3 + ∊ )-approximation for unsplittable flow on a path: placing small tasks into boxes. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. 607–619. https://doi.org/10.1145/3188745.3188894 Google ScholarDigital Library
- Fabrizio Grandoni and Thomas Rothvoß. 2016. Pricing on Paths: A PTAS for the Highway Problem. SIAM J. Comput., 45, 2 (2016), 216–231. https://doi.org/10.1137/140998846 Google ScholarDigital Library
- Fabrizio Grandoni and Andreas Wiese. 2019. Packing Cars into Narrow Roads: PTASs for Limited Supply Highway. In 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany, Michael A. Bender, Ola Svensson, and Grzegorz Herman (Eds.) (LIPIcs, Vol. 144). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 54:1–54:14. https://doi.org/10.4230/LIPIcs.ESA.2019.54 Google ScholarCross Ref
- S. Leonardi, A. Marchetti-Spaccamela, and A. Vitaletti. 2000. Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints. In FSTTCS. 409–420.Google Scholar
- Tomás Martínez-Muñoz and Andreas Wiese. 2021. FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees. In 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference), Petra Mutzel, Rasmus Pagh, and Grzegorz Herman (Eds.) (LIPIcs, Vol. 204). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 67:1–67:15. https://doi.org/10.4230/LIPIcs.ESA.2021.67 Google ScholarCross Ref
- Joseph S. B. Mitchell. 2021. Approximating Maximum Independent Set for Rectangles in the Plane. CoRR, abs/2101.00326 (2021), arXiv:2101.00326. arxiv:2101.00326Google Scholar
- Tobias Mömke and Andreas Wiese. 2015. A (2+∊ ) Approximation Algorithm for the Storage Allocation Problem. In Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I, Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, and Bettina Speckmann (Eds.) (Lecture Notes in Computer Science, Vol. 9134). Springer, 973–984. https://doi.org/10.1007/978-3-662-47672-7_79 Google ScholarCross Ref
- Tobias Mömke and Andreas Wiese. 2020. Breaking the Barrier of 2 for the Storage Allocation Problem. In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference), Artur Czumaj, Anuj Dawar, and Emanuela Merelli (Eds.) (LIPIcs, Vol. 168). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 86:1–86:19. https://doi.org/10.4230/LIPIcs.ICALP.2020.86 Google ScholarCross Ref
- C. A. Phillips, R. N. Uma, and J. Wein. 2000. Off-line admission control for general scheduling problems. In Proceedings of the 11 th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA ’00). ACM, 879–888.Google Scholar
- Andreas Wiese. 2017. A (1+∊ )-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time. In 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland, Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl (Eds.) (LIPIcs, Vol. 80). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 67:1–67:13. https://doi.org/10.4230/LIPIcs.ICALP.2017.67 Google ScholarCross Ref
Index Terms
- A PTAS for unsplittable flow on a path
Recommendations
Approximability of unsplittable shortest path routing problems
In this article, we discuss the relation of unsplittable shortest path routing (USPR) to other routing schemes and study the approximability of three USPR network planning problems. Given a digraph D = (V,A) and a set K of directed commodities, an USPR ...
On the approximability of the minimum congestion unsplittable shortest path routing problem
IPCO'05: Proceedings of the 11th international conference on Integer Programming and Combinatorial OptimizationWe are given an undirected simple graph G = (V,E) with edge capacities $c_{e} \epsilon \mathcal{Z}+$, e ∈ E, and a set K⊆V2 of commodities with demand values d(s,t)εℤ, (s, t) ∈ K. An unsplittable shortest path routing (USPR) of the commodities K is a ...
A quasi-PTAS for unsplittable flow on line graphs
STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of ComputingWe study the Unsplittable Flow Problem (UFP) on line graphs and cycles, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-polynomial time approximation scheme for UFP on line graphs, ...
Comments