Approximate minimum-cost multicommodity flows in {Mathematical expression}(e{open}-2KNM) timetime

Mathematical Programming

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: 77951505650     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF02592195     Document Type: Article

References (16)

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