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