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

Frank Thomson Leighton, Satish Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787-832, 1999. [doi]

Authors

Frank Thomson Leighton

This author has not been identified. Look up 'Frank Thomson Leighton' in Google

Satish Rao

This author has not been identified. Look up 'Satish Rao' in Google