Abstract
In classical network flow theory, flow being sent from a source to a destination may be split into a large number of chunks traveling on different paths through the network. This effect is undesired or even forbidden in many applications. Kleinberg introduced the unsplittable flow problem where all flow traveling from a source to a destination must be sent on only one path. This is a generalization of the NP-complete edge-disjoint paths problem. In particular, the randomized rounding technique of Raghavan and Thompson can be applied. A generalization of unsplittable flows are k-splittable flows where the number of paths used by a commodity i is bounded by a given integer k i .
The contribution of this paper is twofold. First, for the unsplittable flow problem, we prove a lower bound of Ω(log m/loglog m) on the performance of randomized rounding. This result almost matches the best known upper bound of O(log m). To the best of our knowledge, the problem of finding a non-trivial lower bound has so far been open.
In the second part of the paper, we study a new variant of the k-splittable flow problem with additional constraints on the amount of flow being sent along each path. The motivation for these constraints comes from the following packing and routing problem: A commodity must be shipped using a given number of containers of given sizes. First, one has to make a decision on the fraction of the commodity packed into each container. Then, the containers must be routed through a network whose edges correspond, for example, to ships or trains. Each edge has a capacity bounding the total size or weight of containers which are being routed on it. We present approximation results for two versions of this problem with multiple commodities and the objective to minimize the congestion of the network. The key idea is to reduce the problem under consideration to an unsplittable flow problem while only losing a constant factor in the performance ratio.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Extended abstract. Information on the full version of this paper can be found at the authors’ homepages. This work was partially supported by DFG Focus Program 1126, “Algorithmic Aspects of Large and Complex Networks”, grant no. SK 58/4-1, and by EU Thematic Network APPOL II, “Approximation and Online Algorithms”, grant no. IST-2001-30012.
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
Azar, Y., Regev, O.: Strongly polynomial algorithms for the unsplittable flow problem. In: Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, pp. 15–29 (2001)
Bagchi, A.: Efficient Strategies for Topics in Internet Algorithmics. PhD thesis, The Johns Hopkins University (October 2002)
Bagchi, A., Chaudary, A., Scheideler, C., Kolman, P.: Algorithms for faulttolerant routing in circuit switched networks. In: Fourteenth ACM Symposium on Parallel Algorithms and Architectures (2002)
Baier, G., Köhler, E., Skutella, M.: On the k-splittable flow problem. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 101–113. Springer, Heidelberg (2002)
Baveja, A., Srinivasan, A.: Approximation algorithms for disjoint paths and related routing and packing problems. Mathematics of Operations Research 25, 255–280 (2000)
Chekuri, C., Khanna, S.: Edge disjoint paths revisited. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (2003)
Dinitz, Y., Garg, N., Goemans, M.X.: On the single source unsplittable flow problem. Combinatorica 19, 17–41 (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP–Completeness. Freeman, San Francisco (1979)
Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Nearoptimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 19–28 (1999)
Kleinberg, J., Rubinfeld, R.: Short paths in expander graphs. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 86–95 (1996)
Kleinberg, J.M.: Approximation Algorithms for Disjoint Path Problems. PhD thesis, Massachusetts Institute of Technology (May 1996)
Kolliopoulos, S.G., Stein, C.: Approximation algorithms for single-source unsplittable flow. SIAM Journal on Computing 31, 919–946 (2002)
Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 184–193 (2002)
Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences 37, 130–143 (1988)
Raghavan, P., Thompson, C.D.: Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365–374 (1987)
Skutella, M.: Approximating the single source unsplittable min-cost flow problem. Mathematical Programming 91, 493–514 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martens, M., Skutella, M. (2004). Flows on Few Paths: Algorithms and Lower Bounds. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive