Fast approximation algorithms for multicommodity flow problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130073, Issue , 1991, Pages 101-111

  Leighton, Tom ^a   Makedont, Fillia ^b   Plotkin, Serge ^c   Steins, Clifford ^d   Tardost, Eva ^e   Tragoudas, Spyros ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

^c Deparment of Computer Science ^*  (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COST ACCOUNTING; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION;

APPROXIMATE SOLUTION; DETERMINISTIC ALGORITHMS; FAST MATRIX MULTIPLICATION; MINIMUM COST FLOW PROBLEM; MULTICOMMODITY FLOW PROBLEMS; POLYNOMIAL-TIME COMBINATORIAL ALGORITHMS; RANDOMIZED ALGORITHMS; SPECIAL STRUCTURE;

APPROXIMATION ALGORITHMS;

EID: 0038452388     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/103418.103425     Document Type: Conference Paper

References (15)

1. R. K. Ahuja, A.V. Goldberg, J. B. Orlin, and R.E. Tarjan. Finding minimum cost flows by double scaling. Sloan Working Paper 2047-S8, MIT, Cambridge, MA, 1988.
2. J. Edmonds and R.M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19:248-264, 1972.
3. H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for net work problems. SIAM Journal on Cornput: ng, 18:1013-1036, 1989.
4. A. V. Goldberg, Personal communication. Jan., 1991.
5. A. V. Goldberg and R. E, Tarjan. Solving minimumcost flow problems by successive approximation. Mathematics of Operations Research, 15(3):430-466, 1990.
6. L. R. Ford Jr. and D. R. Fulkerson. Flows in networks. Princeton University Press, 1956.
7. S. Kapoor and P. M. Vaidya. Fast algorithms for convex quadratic programming and multicommodity flows. In Proceedings of the 18th Annual ACM Symposium OQ Zheor of Computing, pages 147-159, 1986.
8. P. Klein, A. Agrawal, R. Ravi, and S. Rae. Approximation through multicommodity flow. In Proceedings of the tlst Annual Symposium on Foundations of Computer Science, pages 726-727, 1990.
9. P. Klein, S. A. Plotkin, C. Stein, and E. Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. Technical Report 961, School of Operations Research and Industrial Engineering, Cornell University, 1991. A preliminary version of this paper appeared in Proceedings oj the 22nd A nnual ACM Symposium on Theory of Computing, pages 310-321, 1990.
10. T. Leighton and S. Rae. An approximate max-flow mincut theorem for uniform multicomrnodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 422-431, 1988.
11. F. Makedon and S. Tragoudas. Approximating the minimum net expansion: Near optimaJ solutions to circuit partitioning problems. In Proceedings o.f the 1990 Workshop on Graph Theoretic Concepts in Computer Science, June 1990.
12. J.B. Orlin. A faster strongly polynomial minimum cost flow problem. In Proceedings of the 20th Annual A CM Symposium on Theory of Computing, pages 377-387, 1988.
13. F. Shahrokhi and D. W. Matula, The maximum concurrent flow problem. Journal o, f the A CM, 37:318-334, 1990.
14. P. M. Vaidya. Speeding up linear programming using fast matrix multiplication. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 332-337, 1989.
15. M.A. Yakovleva. A problem on minimum transportation cost. In V.S. Nemchinov, editor, Applications of Mathematics in Economic Research, pages 390-399. Im dat. Socialno-Ekon. Lit., Moscow, 1959.