Abstract
Since the seminal work of Ford and Fulkerson in the 1950s, network flow theory is one of the most important and most active areas of research in combinatorial optimization. Coming from the classical maximum flow problem, we introduce and study an apparently basic but new flow problem that features a couple of interesting peculiarities. We derive several results on the complexity and approximability of the new problem. On the way we also discover two closely related basic covering and packing problems that are of independent interest.
Starting from an LP formulation of the maximum s-t-flow problem in path variables, we introduce unit upper bounds on the amount of flow being sent along each path. The resulting (fractional) flow problem is NP-hard; its integral version is strongly NP-hard already on very simple classes of graphs. For the fractional problem we present an FPTAS that is based on solving the k shortest paths problem iteratively. We show that the integral problem is hard to approximate and give an interesting O(logm)-approximation algorithm, where m is the number of arcs in the considered graph. For the multicommodity version of the problem there is an \(O(\sqrt{m})\)-approximation algorithm. We argue that this performance guarantee is best possible, unless P=NP.
This work was partially supported by the DFG Research Center Matheon in Berlin, by the Graduate School of Production Engineering and Logistics, North Rhine-Westphalia, by the DFG Focus Program 1126 and the DFG grants SK 58/4-1 and SK 58/5-3, and by an NSERC Operating Grant. Part of this work was done while the authors were at Universität Dortmund.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baveja, A., Srinivasan, A.: Approximation algorithms for disjoint paths and related routing and packing problems. Mathematics of Operations Research 25, 255–280 (2000)
Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian J. of Math. 8, 399–404 (1956)
Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In: Proc. 31st Annual ACM Symposium on Theory of Computing, pp. 19–28 (1999)
Kleinberg, J.M.: Approximation Algorithms for Disjoint Path Problems. PhD thesis. MIT (May 1996)
Kolliopoulos, S.G.: Edge-disjoint paths and unsplittable flow. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics, ch. 57. Chapman-Hall/CRC Press (2007)
Lawler, E.L.: A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Management Science 18, 401–405 (1972)
Martens, M., Skutella, M.: Flows on few paths: Algorithms and lower bounds. Networks 48(2), 68–76 (2006)
Plotkin, S.A., Shmoys, D.B., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research 20, 257–301 (1995)
Raghavan, P., Thompson, C.D.: Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365–374 (1987)
Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. on Computing 8(3), 410–421 (1979)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martens, M., Skutella, M. (2008). Flows with Unit Path Capacities and Related Packing and Covering Problems. In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-85097-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85096-0
Online ISBN: 978-3-540-85097-7
eBook Packages: Computer ScienceComputer Science (R0)