Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems

This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different approach to these problems which yields faster and much simpler algorithms. Our approach also allows us to substitute shortest path computations for min-cost flow computations in computing maximum concurrent flow and min-cost multicommodityflow; this yields much faster algorithms when the number of commodities is large.

• Type: Conference
• Year: 1998
• Where: FOCS
• Authors: Naveen Garg, Jochen Könemann
• Keywords: FOCS 1998, Fractional Packing Problems, Min-cost Flow Computations, Shortest Path Computations, Theoretical Computer Science