Abstract
We propose heuristics to reduce the number of shortest path computations required to compute a 1+ε approximation to the maximum multicommodity flow in a graph. Through a series of improvements we are able to reduce the number of shortest path computations significantly. One key idea is to use the value of the best multicut encountered in the course of the algorithm. For almost all instances this multicut is significantly better than that computed by rounding the linear program.
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
Fleischer, L.: Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Discrete Math. 13, 505–520 (2000)
Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings, IEEE Symposium on Foundations of Computer Science, pp. 300–309 (1998)
Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput. 25(2), 235–251 (1996)
Goldberg, A.V., Oldham, J.D., Plotkin, S., Stein, C.: An implementation of a combinatorial approximation algorithm for for minimum-cost multicommodity flows. In: Proceedings, MPS Conference on Integer Programming and Combinatorial Optimization (1998)
Goldfarb, D., Grigoriadis, M.D.: A computational comparison of the dinic and network simplex methods for maximum flow. Annals of Operations Research 13, 83–123 (1988)
Klingman, D., Napier, A., Stutz, J.: Netgen: A program for generating large scale capacitated assignment, transportation and minimum cost flow network problems. Management Science 20, 814–821 (1974)
Leighton, F., Rao, S.: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms. In: Proceedings, IEEE Symposium on Foundations of Computer Science, pp. 422–431 (1988)
Leong, T., Shor, P., Stein, C.: Implementation of a combinatorial multicommodity flow algorithm. In Network flows and matchings, DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol. 12, pp. 387–405. American Mathematical Society, Providence (1993)
Radzik, T.: Experimental study of a solution method for the multicommodity flow problem. In: Workshop on Algorithm Engineering and Experiments, pp. 79–102 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Batra, G., Garg, N., Gupta, G. (2005). Heuristic Improvements for Computing Maximum Multicommodity Flow and Minimum Multicut. In: Brodal, G.S., Leonardi, S. (eds) Algorithms – ESA 2005. ESA 2005. Lecture Notes in Computer Science, vol 3669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561071_6
Download citation
DOI: https://doi.org/10.1007/11561071_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29118-3
Online ISBN: 978-3-540-31951-1
eBook Packages: Computer ScienceComputer Science (R0)