Abstract
This work is motivated by the need for approximation algorithms for the integral multicommodity flow problem which arise in numerous optimization scenarios, including the design of telecommunication networks. We improve on one of the most efficient known combinatorial approximation algorithm for fractional multicommodity flow by using an incremental approach. This approach is validated by experimental results, which show a significant speed-up.
Work funded by European project fet crescco and action color dynamic.
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
Bouklit, M., Coudert, D., Lalande, J.-F., Paul, C., Rivano, H.: Approximate multicommodity flow for wdm networks design. In: Sirocco 10, Umea, Sweden (June 2003)
Bertimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)
Coudert, D., Rivano, H.: Lightpath assignment for multifibers WDM optical networks with wavelength translators. In: IEEE Globecom 2002, Taiwan (November 2002) OPNT-01-5
Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)
Fleischer, L.: Approximating fractional multicommodity flows independent of the number of commodities. SIAM J. Discrete Math. 13(4), 505–520 (2000)
Garg, N., Konemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: IEEE Symposium on Foundations of Computer Science, pp. 300–309 (1998)
Raghavan, P.: Probabilistic construction of deterministic algorithm: Approximating packing integer programs. Journal of Computer and Systems Sciences 38, 683–707 (1994)
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
Coudert, D., Rivano, H., Roche, X. (2004). A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem. In: Solis-Oba, R., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2003. Lecture Notes in Computer Science, vol 2909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24592-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-24592-6_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21079-5
Online ISBN: 978-3-540-24592-6
eBook Packages: Springer Book Archive