Approximate minimum-cost multicommodity flows in $$\tilde O$$ (ɛ −2 KNM) timetime
- 1 December 1996
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 75 (3), 477-482
- https://doi.org/10.1007/bf02592195
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Approximate Structured Optimization by Cyclic Block-Coordinate DescentPublished by Springer Nature ,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
- Finding Minimum-Cost Circulations by Successive ApproximationMathematics of Operations Research, 1990
- Solving Singly Constrained Transshipment ProblemsTransportation Science, 1978