A team of researchers led by Rasmus Kinn of the Swiss Federal Institute of Technology in Zurich has created a near-perfect algorithm to calculate the maximum transport flows at the lowest cost in any ...

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

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

Finding the most efficient way to transport items across a network like the U.S. highway system or the Internet is a problem that has taxed mathematicians and computer scientists for decades. To ...