Author:
Awerbuch Baruch,Leighton Tom
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. 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.
2. 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.
3. L.R. Ford and D.R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962.
4. 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.
5. A.V. Goldberg and R. E. Tarjan. Solving minimum-cost flow problems by successive approximation. Mathematics of Operations Research, 15(3):430–466, 1990.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献