VLSI partitioning approximation algorithms based on multicommodity flow and other techniques

Excluded minors, network decomposition, and multicommodity flow

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Improved bounds on the max-flow min-cut ratio for multicommodity flows

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Approximate max-flow min-(multi)cut theorems and their applications

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

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

Journal of the ACM (JACM)