Sciweavers

Share
IPCO
1998

Simple Generalized Maximum Flow Algorithms

10 years 29 days ago
Simple Generalized Maximum Flow Algorithms
We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorialalgorithms for the problem. Truemper's augmenting path algorithm is one of the simplest combinatorial algorithms for the problem, but runs in exponential-time. Our rst algorithm is a polynomial-time variant of Truemper's algorithm. Our second algorithm is an adaption of Goldberg and Tarjan's pre owpush algorithm. It is the rst polynomial-time pre ow-push algorithm in generalized networks. Our third algorithm is a variant of the Fat-Path capacity-scaling algorithm. It is much simpler than Radzik's variant and matches the best known complexityfor the problem. We discuss practical improvements in implementation.
Éva Tardos, Kevin D. Wayne
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 1998
Where IPCO
Authors Éva Tardos, Kevin D. Wayne
Comments (0)
books