A natural randomization strategy for multicommodity flow and related algorithms

DOI10.1016/0020-0190(92)90032-QzbMath0773.90026MaRDI QIDQ1198070

Andrew V. Goldberg

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

multicommodity flowrandomization strategy

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Parallel algorithms in computer science (68W10)

Related Items (5)

Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time ⋮ Unnamed Item ⋮ Fast approximation of minimum multicast congestion – Implementation VERSUS Theory ⋮ A combinatorial approximation algorithm for concurrent flow problem and its application ⋮ Multicast Routing and Design of Sparse Connectors

Cites Work

• A new polynomial-time algorithm for linear programming
• The maximum concurrent flow problem
• Polynomial algorithms in linear programming
• Unnamed Item

This page was built for publication: A natural randomization strategy for multicommodity flow and related algorithms