Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (1999)

by Tom Leighton, Satish Rao
Venue:Journal of the ACM