Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

Philip N. Klein, Serge A. Plotkin, Clifford Stein, Éva Tardos. Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts. SIAM Journal on Computing, 23(3):466-487, 1994.

No reviews for this publication, yet.