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

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