Approximate minimum-cost multicommodity flows in Õ(ε-2KNM) time

Mathematical Programming, Series B

Volumn 75, Issue 3, 1996, Pages 477-482

  Grigoriadis, Michael D ^a   Khachiyan, Leonid G ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Approximation algorithm; Block angular program; Budget constrained network flow; Minimum cost multicommodity network flow; Structured optimization

Indexed keywords

EID: 0001000679     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592195     Document Type: Article

References (14)

1. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows (Prentice-Hall, Englewood Cliffs, NJ, 1993).
2. F. Glover, D. Karney, D. Klingman and R. Rusell, Solving singly constrained transshipment problems, Transportation Science 12 (1978) 277-297.
3. M.D. Grigoriadis and L.G. Khachiyan, Fast approximation schemes for convex programs with many blocks and coupling constraints, SIAM J. Optimization 4 (1994) 86-107.
4. M.D. Grigoriadis and L.G. Khachiyan, Coordination complexity of parallel price-directive decomposition, Tech. Rept. 94-19, DIMACS, Rutgers University, New Brunswick, NJ, 1994, Mathematics of Operations Research 21 (2) (1996) 321-340.
5. A. Goldberg, A natural randomization strategy for multicommodity flow and related problems, Information Processing Letters 42 (1992) 249-256.
6. A. Goldberg and R.E. Tarjan, Solving minimum cost flow problems by successive approximation, Mathematics of Operations Research 15 (1990) 430-466.
7. T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos and S. Tragoudas, Fast approximation algorithms for multicommodity flow problems, J. Computer and System Sciences 50 (1995) 228-243; see also: Proc. 23rd Ann. ACM Symp. on Theory of Computing (1991) 101-111.
8. T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos and S. Tragoudas, Fast approximation algorithms for multicommodity flow problems, J. Computer and System Sciences 50 (1995) 228-243; see also: Proc. 23rd Ann. ACM Symp. on Theory of Computing (1991) 101-111.
9. D. Karger and S.A. Plotkin, Adding multiple cost constraints to combinatorial optimization problems with applications to multicommodity flows, in: Proc. 27th Annual ACM Symp. on Theory of Computing (1995) 18-25.
10. A. Kamath, O. Palmon and S. Plotkin, Fast approximation algorithm for min-cost multicommodity flow, in: Proc. 6th ACM-SIAM Symp. on Discrete Algorithms (1995) 493-501.
11. S.A. Plotkin, D.B. Shmoys and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operation Research 20 (1995) 257-301; see also: Proc. 32nd Ann. Symp. on Foundations of Computer Science (1991) 495-504.
12. S.A. Plotkin, D.B. Shmoys and E. Tardos, Fast approximation algorithms for fractional packing and covering problems, Mathematics of Operation Research 20 (1995) 257-301; see also: Proc. 32nd Ann. Symp. on Foundations of Computer Science (1991) 495-504.
13. T. Radzik, Fast deterministic approximation for the multicommodity flow problem, in: Proc. 6th ACM-SIAM Symp. on Discrete Algorithms (1995) 486-492.
14. J. Villavicencio and M.D. Grigoriadis, Approximate structured optimization by cyclic block coordinate descent, in: H. Fischer, B. Riedmüller and S. Schäffler, eds., Applied Mathematics and Parallel Computing - Festschrift for Klaus Ritter (Physica-Verlag, Heidelberg, 1996) 359-371; also: Tech. Rept. LCSR-TR-255, Dept. of Computer Science, Rutgers University, New Brunswick, NJ.