Date: 30 Jan 2003

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem and the general minimum-cost flow problem. Upper bounds on the number of steps in these algorithms are derived, and are shown to improve on the upper bounds of earlier algorithms.