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

by F T Leighton, S Rao
Venue:Journal of the ACM