Simple Maximum Flow Algorithms in Lossy Networks

@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
3 Citations
21 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

On max ows with gains and pure min-cost ows,

  • K. Truemper
  • SIAM J. Appl. Math,
  • 1977
Highly Influential
4 Excerpts

Dynamic programming of optimum ows in lossy communication nets,

  • K. Onaga
  • IEEE Trans. Circuit Theory ,
  • 1966
Highly Influential
7 Excerpts

Optimal ow through networks with gains,

  • W. S. Jewell
  • Operations Research,
  • 1962
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…