Researchers develop fastest possible flow algorithm Date: June 28, 2024 Source: ETH Zurich Summary: Computer scientists have written a network flow algorithm that computes almost as fast as is ...

Fulkerson and Ford's algorithm proved effective enough, but it often didn't produce the best possible flow: If other routes were cut off and suboptimal jams emerged, so be it.

Jul 14, 2024 23:40:00 An algorithm that can calculate the maximum transport flow at the lowest cost and the fastest speed for all kinds of networks such as railroads, roads, and electricity has ...

The new algorithm is “absurdly fast,” said Daniel Spielman of Yale University. “I was actually inclined to believe … algorithms this good for this problem would not exist.” Maximum flow has been ...

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

Using Kyng’s algorithm, the “additional” computing time required to reach the solution after reading the network data is now negligible. Like a Porsche racing a horse-drawn carriage. The ETH Zurich ...

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.