An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms (0)

by T Leighton, S Rao
Venue:In Proc. 29th Ann. IEEE Symp. on Foundations of Comput. Sci.,pages