Published on *Computer Science Department at Princeton University* (http://www.cs.princeton.edu)

Several researchers have recently developed new techniques that give fast algorithms for the minimum-cost flow problem. In this paper we combine several of these techniques to yield an algorithm running in O(nmlog log U log(nC)) time on networks with n vertices, m arcs, maximum are capacity U, and maximum

arc cost magnitude C. The major techniques used are the capacity-scaling approach of Edmonds and Karp, the excess-scaling approach of Ahuja and Orlin, the cost-scaling approach of Goldberg and Tarjan, and the dynamic tree data structure of Sleator and Tarjan. For nonsparse graphs with large maximum arc capacity, we obtain a similar but slightly better bound. We also obtain a slightly better bound for the (noncapacitated) transportation problem. In addition, we discuss a capacity-bounding approach to the minimum-cost flow problem.

**Links**

[1] http://www.cs.princeton.edu/research/techreps/author/4

[2] http://www.cs.princeton.edu/research/techreps/author/412

[3] http://www.cs.princeton.edu/research/techreps/author/152

[4] http://www.cs.princeton.edu/research/techreps/author/384

[5] ftp://ftp.cs.princeton.edu/techreports/1988/164.pdf