Cited By
View all- Faenza YSegev DZhang L(2022)Approximation algorithms for the generalized incremental knapsack problemMathematical Programming: Series A and B10.1007/s10107-021-01755-7198:1(27-83)Online publication date: 30-Jan-2022
A Mazing 2+ε Approximation for Unsplittable Flow on a Path
Authors: 
Aris Anagnostopoulos, Fabrizio Grandoni, 
Stefano Leonardi, Andreas WieseAuthors Info & Claims
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas WieseAuthors Info & ClaimsArticle No.: 55, Pages 1 - 23
Abstract
We study the problem of unsplittable flow on a path (UFP), which arises naturally in many applications such as bandwidth allocation, job scheduling, and caching. Here we are given a path with nonnegative edge capacities and a set of tasks, which are characterized by a subpath, a demand, and a profit. The goal is to find the most profitable subset of tasks whose total demand does not violate the edge capacities. Not surprisingly, this problem has received a lot of attention in the research community.
If the demand of each task is at most a small-enough fraction δ of the capacity along its subpath (δ-small tasks), then it has been known for a long time [Chekuri et al., ICALP 2003] how to compute a solution of value arbitrarily close to the optimum via LP rounding. However, much remains unknown for the complementary case, that is, when the demand of each task is at least some fraction δ > 0 of the smallest capacity of its subpath (δ-large tasks). For this setting, a constant factor approximation is known, improving on an earlier logarithmic approximation [Bonsma et al., FOCS 2011].
In this article, we present a polynomial-time approximation scheme (PTAS) for δ-large tasks, for any constant δ > 0. Key to this result is a complex geometrically inspired dynamic program. Each task is represented as a segment underneath the capacity curve, and we identify a proper maze-like structure so that each corridor of the maze is crossed by only O(1) tasks in the optimal solution. The maze has a tree topology, which guides our dynamic program. Our result implies a 2+ε approximation for UFP, for any constant ε > 0, improving on the previously best 7+ε approximation by Bonsma et al. We remark that our improved approximation algorithm matches the best known approximation ratio for the considerably easier special case of uniform edge capacities.
References
[1]
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.
[2]
A. Anagnostopoulos, F. Grandoni, S. Leonardi, and A. Wiese. 2013. Constant integrality gap LP formulations of unsplittable flow on a path. In IPCO. 25--36.
[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.
[4]
E. M. Arkin and E. B. Silverberg. 1987. Scheduling jobs with fixed start and end times. Discrete Applied Mathematics 18, 1 (1987), 1--8.
[5]
Y. Azar and O. Regev. 2006. Combinatorial algorithms for the unsplittable flow problem. Algorithmica 44, 1 (2006), 49--66.
[6]
N. Bansal, A. Chakrabarti, A. Epstein, and B. Schieber. 2006. A quasi-PTAS for unsplittable flow on line graphs. In STOC. 721--729.
[7]
N. Bansal, Z. Friggstad, R. Khandekar, and R. Salavatipour. 2009. A logarithmic approximation for unsplittable flow on line graphs. In SODA. 702--709.
[8]
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.
[9]
R. Bar-Yehuda, M. Beder, Y. Cohen, and D. Rawitz. 2006. Resource allocation in bounded degree trees. In ESA. 64--75.
[10]
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.
[11]
Paul Bonsma, Jens Schulz, and Andreas Wiese. 2014. A constant-factor approximation algorithm for unsplittable flow on paths. SIAM Journal on Computing 43, 2 (2014), 767--799.
[12]
G. Calinescu, A. Chakrabarti, H. Karloff, and Y. Rabani. 2002. Improved approximation algorithms for resource allocation. In IPCO. 401--414.
[13]
A. Chakrabarti, C. Chekuri, A. Gupta, and A. Kumar. 2007. Approximation algorithms for the unsplittable flow problem. Algorithmica 47, 1 (2007), 53--78.
[14]
C. Chekuri, A. Ene, and N. Korula. Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. Retrieved September 2, 2018 from http://cs-people.bu.edu/aene/papers/ufp-full.pdf.
[15]
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.
[16]
C. Chekuri, M. Mydlarz, and F. Shepherd. 2007. Multicommodity demand flow in a tree and packing integer programs. ACM Transactions on Algorithms 3 (2007). An extended abstract appeared in the Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP’03).
[17]
B. Chen, R. Hassin, and M. Tzur. 2002. Allocation of bandwidth and storage. IIE Transactions 34 (2002), 501--507.
[18]
M. Chrobak, G. Woeginger, K. Makino, and H. Xu. 2010. Caching is hard, even in the fault model. In ESA. 195--206.
[19]
A. Darmann, U. Pferschy, and J. Schauer. 2010. Resource allocation with time intervals. Theoretical Computer Science 411, 49 (2010), 4217--4234.
[20]
N. Garg, V. V. Vazirani, and M. Yannakakis. 1997. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18, 1 (1997), 3--20.
[21]
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.
[22]
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 STOC. To appear.
[23]
J. M. Kleinberg. 1996. Approximation Algorithms for Disjoint Paths Problems. Ph.D. dissertation. MIT.
[24]
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.
[25]
C. A. Phillips, R. N. Uma, and J. Wein. 2000. Off-line admission control for general scheduling problems. In SODA. 879--888.
[26]
A. Schrijver. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin.
Index Terms
- A Mazing 2+ε Approximation for Unsplittable Flow on a Path
Recommendations
A mazing 2+ε approximation for unsplittable flow on a path
SODA '14: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithmsWe study the unsplittable flow on a path problem (UFP), which arises naturally in many applications such as bandwidth allocation, job scheduling, and caching. Here we are given a path with nonnegative edge capacities and a set of tasks, which are ...
Approximation Algorithms for the Unsplittable Flow Problem
We present approximation algorithms for the unsplittable flow problem (UFP) in undirected graphs. As is standard in this line of research, we assume that the maximum demand is at most the minimum capacity. We focus on the non-uniform capacity case in ...
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem
In this paper, we consider the Unsplittable (hard) Capacitated Facility Location Problem (UCFLP) with uniform capacities and present new approximation algorithms for it. This problem is a generalization of the classical facility location problem where ...
Comments
Information & Contributors
Information
Published In
October 2018
445 pages
Copyright © 2018 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 September 2018
Accepted: 01 July 2018
Revised: 01 April 2018
Received: 01 May 2017
Published in TALG Volume 14, Issue 4
Check for updates
Author Tag
Qualifiers
- Research-article
- Research
- Refereed
Funding Sources
- ERC StG project PAAl
- Postdoc-Programme of the German Academic Exchange Service (DAAD)
- ERC Starting
- EU FET
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 114Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)1
Reflects downloads up to 30 Aug 2024
Other Metrics
Citations
Cited By
View all- Faenza YSegev DZhang L(2022)Approximation algorithms for the generalized incremental knapsack problemMathematical Programming: Series A and B10.1007/s10107-021-01755-7198:1(27-83)Online publication date: 30-Jan-2022
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format