An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm

Zvi Galil, va Tardos

Browse the full FOCS paper archive.