Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow. Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024 DOI ...

Named after its creator, John Nagle, this algorithm plays a part in the efficient operation of your router’s TCP/IP traffic. That being so, savvy gamers have added it to a list of things to ...

A new algorithm has shown in simulations that traffic jams can be considerably reduced — even if just 10 percent of cars on the road follow its guidelines.

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

In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling technique. Our algorithm solves the ...

Like a Porsche racing a horse-drawn carriage The ETH Zurich researchers have thus developed what is, in theory, the fastest possible network flow algorithm. Two years ago, Kyng and his team ...