Before revision: We present an m^{ 11 / 8 +o(1)}\log W-time algorithm for solving the minimum cost flow problem in graphs with unit capacity,
After revision: We present an m^{ 4 / 8 +o(1)}\log W-time algorithm for solving the minimum cost flow problem in graphs with unit capacity,