A natural randomization strategy for multicommodity flow and related algorithms
Open Access
- 3 July 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 42 (5) , 249-256
- https://doi.org/10.1016/0020-0190(92)90032-q
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fast approximation algorithms for fractional packing and covering problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast approximation algorithms for multicommodity flow problemsPublished by Association for Computing Machinery (ACM) ,1991
- Finding Minimum-Cost Circulations by Successive ApproximationMathematics of Operations Research, 1990
- 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
- Finding Minimum-Cost Flows by Double ScalingPublished by Defense Technical Information Center (DTIC) ,1988
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984