New Directions in Network Flows

摘要

Progress has been made on a number of problems including improved algorithms forthe minimum cut problem and the arrangement problem as well as new data compression techniques for the shortest path problem.