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]

No reviews for this publication, yet.