An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms - researchr publication

researchr

You are not signed in
Sign in
Sign up

Frank Thomson Leighton, Satish Rao. An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms. In 29th Annual Symposium on Foundations of Computer Science, 24-26 October 1988, White Plains, New York, USA. pages 422-431, IEEE, 1988.

Abstract is missing.

runs on WebDSL