Faster and simpler algorithms for multicommodity flow and other fractional packing problems
- 27 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 300-309
- https://doi.org/10.1109/sfcs.1998.743463
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Fast Approximate Graph Partitioning AlgorithmsSIAM Journal on Computing, 1999
- Approximate minimum-cost multicommodity flows in $$\tilde O$$ (ɛ −2 KNM) timetimeMathematical Programming, 1996
- Fast deterministic approximation for the multicommodity flow problemMathematical Programming, 1996
- Fast Approximation Algorithms for Fractional Packing and Covering ProblemsMathematics of Operations Research, 1995
- Fast Approximation Algorithms for Multicommodity Flow ProblemsJournal of Computer and System Sciences, 1995
- Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flowsPublished by Association for Computing Machinery (ACM) ,1995
- Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling ConstraintsSIAM Journal on Optimization, 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