Post by ETH Zürich

Rasmus Kyng has written the near-perfect #Algorithm. It computes the maximum #TransportFlow at minimum cost for any kind of network – be it rail, road or electricity – at a speed that is, mathematically speaking, impossible to beat. 🚦 In brief ◼️ 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 transport costs for any type of network. It thus solves a key question in theoretical computer science. ◼️ The superfast algorithm also lays the foundation for efficiently computing very large and dynamically changing networks in the future. Article: FlorianMeyer Image: Adobe Stock Related: Rasmus Kyng, IEEE, Quanta Magazine, ETH Zurich, Department of Information Technology and Electrical Engineering