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

The maximum-flow problem, or max flow, is one of the most basic problems in computer science. MIT researchers, together with colleagues at Yale and the University of Southern California, have ...

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