Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
VLSI partitioning approximation algorithms based on multicommodity flow and other techniques
VLSI partitioning approximation algorithms based on multicommodity flow and other techniques
Approximate max-flow min-(multi)cut theorems and their applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Excluded minors, network decomposition, and multicommodity flow
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)
A New Min-Cut Max-Flow Ratio for Multicommodity Flows
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms
Approximate max-integral-flow/min-multicut theorems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximation algorithms for requirement cut on graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
| Hi-index | 0.00 |