Portions of this paper were taken from [1]. This work was supported in part by Air Force Contract AFOSR F49620-92-J-0125 and DARPA Contracts N00014-91-J-1698 and N00014-92-J-1799.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baruch Awerbuch and Tom Leighton. A Simple local-control approximation algorithm for multicommodity flow. In Proc. 34th IEEE Symp. on Foundations of Computer Science. November. 1993. To appear.
Jack B. Dennis. Distributed solution of network programming problems. In IEEE Transactions of the Professional Technical Group on Communications Systems, volume CS-12, number 2, pages 176–184, June 1964.
L.R. Ford and D.R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
N. Garg, V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. In Proc. 25th ACM Symp. on Theory of Computing, pages 698–707, May 1993.
A.V. Goldberg and R. E. Tarjan. Solving minimum-cost flow problems by successive approximation. Mathematics of Operations Research, 15(3):430–466, 1990.
A. V. Karzanov. Determining the maximal flow in a network by the method of preflows. Soviet Math. Dokl. 15:434–437, 1974.
P. Klein, A. Agrawal, R. Ravi, and S. Rao. Approximation through multicommodity flow. In Proc. 31st IEEE Symp. on Foundations of Computer Science, pages 726–727, 1990.
P. Klein, S. Plotkin, and S. Rao. Excluded minors, network decomposition, and multicommodity flow. In Proc. 25th ACM Symp. on Theory of Computing, pages 682–690, May 1993.
F. T. Leighton and Satish Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In 29th Annual Symposium on Foundations of Computer Science, IEEE, pages 422–431, 1988.
T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problem. In Proc. 23rd ACM Symp. on Theory of Computing, pages 101–111, May 1991.
S. Plotkin and E. Tardos Improved bounds on the max-flow min-cut ratio for multicommodity flow. In Proc. 25th ACM Symp. on Theory of Computing, pages 691–697, May 1993.
S. Tragoudas. VLSI partitioning approximation algorithms based on multicommodity flows and other techniques. PhD thesis, University of Texas at Dallas, 1991.
Mark Tsimelzon. Bachelor thesis, MIT Lab. for Computer Science, 1993.
P.M. Vaidya. Speeding up linear programming using fast matrix multiplication. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 332–337, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Awerbuch, B., Leighton, T. (1993). Multicommodity flows: A survey of recent research. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_260
Download citation
DOI: https://doi.org/10.1007/3-540-57568-5_260
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57568-9
Online ISBN: 978-3-540-48233-8
eBook Packages: Springer Book Archive