Abstract
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edge-disjoint paths? Equivalently, we wish to find a maximum weighted packing of disjoint paths, where the weight of a path is the minimum capacity of an edge on the path. Our main result is an Ω(logn) lower bound on the approximability of the problem. We also show this bound is tight to within a constant factor. Surprisingly, the lower bound applies even for the simple case of undirected, planar graphs.
Our results extend to the case in which the flow must decompose into at most k disjoint paths. There we obtain Θ(logk) upper and lower approximability bounds.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andrews, M., Chuzhoy, J., Guruswami, V., Khanna, S., Talwar, K., Zhang, L.: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Electronic Colloquium on Computational Complexity 14(113) (2007)
Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
Chekuri, C., Khanna, S., Shepherd, B.: Edge-disjoint paths in planar graphs with constant congestion. SIAM J. Computing 39(1), 281–301 (2009)
Chuzhoy, J., Guruswami, V., Khanna, S., Talwar, K.: Hardness of routing with congestion in directed graphs. In: Proceedings of the 39th ACM Symposium on Theory of Computing, STOC (2007)
Dinitz, Y., Garg, N., Goemans, M.: On the single-source unsplittable flow problem. Combinatorica 19, 17–41 (1999)
Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science 10, 111–121 (1980)
Baier, G., Kohler, E., Skutella, M.: The k-splittable flow problem. Algorithmica 42, 231–248 (2005)
Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. Journal of Computer and System Sciences 67(3), 473–496 (2003)
Kleinberg, J.: Single-source unsplittable flow. In: Proceedings of the 37th on Foundations of Computer Science (FOCS), pp. 68–77 (1996)
Koch, R., Spenke, I.: Complexity and approximability of k-splittable flows. Theoretical Computer Science 369, 338–347 (2006)
Salazar, F., Skutella, M.: Single-source k-splittable min-cost flows. Operations Research Letters 37(2), 71–74 (2009)
Shepherd, B.: Single-sink multicommodity flow with side constraints. In: Cook, W., Lovasz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 429–450. Springer, Heidelberg (2009)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Naves, G., Sonnerat, N., Vetta, A. (2010). Maximum Flows on Disjoint Paths. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 2010 2010. Lecture Notes in Computer Science, vol 6302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15369-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-15369-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15368-6
Online ISBN: 978-3-642-15369-3
eBook Packages: Computer ScienceComputer Science (R0)