Fast deterministic approximation for the multicommodity flow problem
- 1 July 1996
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 78 (1), 43-58
- https://doi.org/10.1007/bf02614505
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Approximation through multicommodity flowPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast Approximation Algorithms for Multicommodity Flow ProblemsJournal of Computer and System Sciences, 1995
- Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse CutsSIAM Journal on Computing, 1994
- A natural randomization strategy for multicommodity flow and related algorithmsInformation Processing Letters, 1992
- The maximum concurrent flow problemJournal of the ACM, 1990
- Speeding-up linear programming using fast matrix multiplicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988