GIGAZINE

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

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

Researchers at ETH Zurich develop the fastest possible flow algorithm

In a breakthrough that brings to mind Lucky Luke – the man who shoots faster than his shadow – Rasmus Kyng and his team have developed a superfast algorithm that looks set to transform an entire field ...
Live Science

'Absurdly fast' algorithm solves 70-year-old logjam — speeding up network traffic in areas from airline scheduling to the internet

It's quick and easy to access Live Science Plus, simply enter your email below. We'll send you a confirmation and sign you up for our daily newsletter, keeping you up to date with the latest science ...
Fast Company

How The Solution To A Soviet-Era Train Congestion Problem Could Lead To A New Era In Networking

The question of how best to transport items across a network–be that traffic over the Internet, or cars over the U.S. highway system–is one that has challenged mathematicians and computer scientists ...
mccormick.northwestern.edu

COMP_SCI 457: Advanced Algorithms

CATALOG DESCRIPTION: Design and analysis of advanced algorithms: graph algorithms; maximal network flows; min-cost flow algorithms; convex cost flows. REQUIRED TEXT ...