An O(n2(m + Nlog n)log n) min-cost flow algorithm

The minimum-cost flow problem is: Given a network with n vertices and m edges, find a maximum flow of minimum cost. Many network problems are easily reducible to this problem. A polynomial-time alg...