Their algorithm efficiently solves the maximum-flow problem, which seeks to determine how to transport as many goods through a network as possible without exceeding the capacity of the individual ...

The capacity scaling algorithm solves it in O (m (m + n log n) log (nU)) time, which is almost the same time needed to solve the minimum cost flow problem by the capacity scaling algorithm. These ...

New Algorithm from MIT, Yale, and USC Tackles Max Flow Challenge By Dian Schaffhauser 01/09/14 Researchers from MIT, Yale University, and the University of Southern California have developed what they ...

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs ...