@inproceedings{Tardos1997SimpleMF,
title={Simple Maximum Flow Algorithms in Lossy Networks},
author={Eva Tardos and Kevin D. WayneyNovember},
year={1997}
}

We introduce a gain-scaling technique for the maximum ow problem in lossy networks. Using this technique, we present three simple and intuitive polynomial-time combinatorial algorithms 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â€¦Â CONTINUE READING