A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...
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 ...
Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 (27 pages) This paper is concerned with the design and probabilistic analysis of algorithms for the maximum-flow problem and ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback