Kyng's algorithm can be applied in such cases to calculate the optimal, lowest-cost traffic flow for any kind of network—be it rail, road, water or the internet.

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

Algorithm promises to greatly streamline solutions to the 'max flow' problem. Research could boost the efficiency even of huge networks like the Internet. Finding the most efficient way to ...

We present a penalty-based algorithm that solves the multicommodity flow problem as a sequence of a finite number of scaling phases. The basis of the algorithm is simple and consists of iteratively ...

The original version of this article implied that Dijkstra’s original shortest-path algorithm, from the 1950s, achieved the theoretical speed limit for positive-weight graphs. In fact, the speed limit ...

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