Fast deterministic approximation for the multicommodity flow problem

Mathematical Programming, Series B

Volumn 78, Issue 1, 1996, Pages 43-58

  Radzik, Tomasz ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Approximate solution; Concurrent flow; Multicommodity flow; Network flow; Network optimization

Indexed keywords

EID: 0040510449     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf02614505     Document Type: Article

References (14)

1. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network flows. Theory, algorithms, and applications (Prentice-Hall, Englewood Cliffs, NJ, 1993).
2. B. Awerbuch and T. Leighton, Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks, in: Proceedings of 26th Annual ACM Symposium on Theory of Computing (1994) 487-496.
3. A.V. Goldberg, A natural randomization strategy for multicommodity flow and related algorithms, Information Processing Letters 42 (1992) 249-256.
4. M.D. Grigoriadis and L.G. Khachiyan, Fast approximation schemes for convex programs with many blocks and coupling constraints, Technical Report DCS-TR-273, Department of Computer Science, Rutgers University, 1991.
5. A. Kamath and O. Palmon, Improved interior point algorithms for exact and approximate solution of multicommodity flow problems, in: Proceedings of 6th ACM-SIAM Symposium on Discrete Algorithms (1995) 502-511.
6. P. Klein, A. Agrawal, R. Ravi and S. Rao, Approximation through multicommodity flow, in: Proceedings of 31th Annual IEEE Symp. Foundations of Computer Science (1990) 726-737.
7. P. Klein, S. Plotkin, C. Stein and É Tardos, Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts, SIAM Journal on Computing 23 (1994) 466-487.
8. T. Leighton, F. Makedon, S. Plotkin, C. Stein E. Tardos and S. Tragoudas, Fast approximation algorithms for multicommodity flow problems, Journal of Computer and System Sciences 50 (1995) 228-243.
9. T. Leighton and S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in: Proceedings of 29th Annual IEEE Symp. Foundations of Computer Science (1988) 422-431.
10. T. Leong, P. Shor and C. Stein, Implementation of a combinatorial multicommodity flow algorithm, in: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 12 (American Mathematical Society, Providence, RI, 1993) 387-405.
11. D.W. Matula, Concurrent flow and concurrent connectivity in graphs, in: Y. Alavi, G. Chartrand, L. Lesniak, D. Lick and C.E. Wall, eds., Graph theory and its applications to algorithms and Computer Science (Wiley, New York, 1985) 543-559.
12. C. Haibt Norton, S.A. Plotkin and É. Tardos, Using separation algorithms in fixed dimension, Journal of Algebra 13 (1992) 79-98.
13. F. Shahrokhi and D.W. Matula, The maximum concurrent flow problem, Journal of the Association for Computing Machinery 37 (1990) 318-334.
14. P.M. Vaidya, Speeding up linear programming using fast matrix multiplication, in: Proceedings of 30th IEEE Annual Symposium on Foundations of Computer Science (1989) 332-337.