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 ...

The problem asks how much material can flow through a network from a source to a destination if the links in the network have capacity limits. The new algorithm is “absurdly fast,” said Daniel ...

These tweaks shifted the runtime of the algorithm from a multiple m^2 (where m is the number of nodes in the network) to a multiple of m^1.33 in 2004, but then progress stalled. RELATED STORIES ...

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