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

by Tom Leighton, Satish Rao
Venue:In Foundations of Computer Science, 1988., 29th Annual Symposium on,