Summary
Classical network flow problems do not impose restrictions on the choice of paths on which flow is sent. Only the arc capacities of the network have to be obeyed. This scenario is not always realistic. In fact, there are many problems for which, e.g., the number of paths being used to route a commodity or the length of such paths has to be small. These restrictions are considered in the length-bounded k-splittable s-t-flowproblem: The problem is a variant of the well known classical s-t-flow problem with the additional requirement that the number of paths that may be used to route the flow and the maximum length of those paths are bounded. Our main result is that we can efficiently compute a length-bounded s-t-flow which sends one fourth of the maximum flow value while exceeding the length bound by a factor of at most 2. We also show that this result leads to approximation algorithms for dynamic k-splittable s-t-flows.
This work was partially supported by DFG Focus Program 1126, “Algorithmic Aspects of Large and Complex Networks”, grant no. SK 58/4-1 and SK 58/5-3.
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
A. Bagchi. Efficient Strategies for Topics in Internet Algorithmics. PhD thesis, The Johns Hopkins University, October 2002.
G. Baier. Flows with Path Restrictions. PhD thesis, TU Berlin, 2003.
G. Baier, E. Köhler, and M. Skutella. On the k-splittable flow problem. Algorithmica, 42:231–248, 2005.
L. Fleischer and M. Skutella. The quickest multicommodity flow problem. In Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization, pages 36–53, 2002.
L. R. Ford and D. R. Fulkerson. Constructing maximal dynamic flows from static flows. Operations Research, 6, pages 419–433, 1958.
J. M. Kleinberg. Approximation Algorithms for Disjoint Path Problems. PhD thesis, Massachusetts Institute of Technology, May 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martens, M., Skutella, M. (2006). Length-Bounded and Dynamic k-Splittable Flows. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_47
Download citation
DOI: https://doi.org/10.1007/3-540-32539-5_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32537-6
Online ISBN: 978-3-540-32539-0
eBook Packages: Business and EconomicsBusiness and Management (R0)