Divide-and-conquer approximation algorithms via spreading metrics
- 1 July 2000
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 47 (4) , 585-616
- https://doi.org/10.1145/347476.347478
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithmsJournal of the ACM, 1999
- Fast Approximate Graph Partitioning AlgorithmsSIAM Journal on Computing, 1999
- Approximating Minimum Feedback Sets and Multicuts in Directed GraphsAlgorithmica, 1998
- An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation AlgorithmSIAM Journal on Computing, 1998
- Approximation Algorithms for Steiner and Directed MulticutsJournal of Algorithms, 1997
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their ApplicationsSIAM Journal on Computing, 1996
- The geometry of graphs and some of its algorithmic applicationsCombinatorica, 1995
- Interior-Point Polynomial Algorithms in Convex ProgrammingPublished by Society for Industrial & Applied Mathematics (SIAM) ,1994
- Geometric Algorithms and Combinatorial OptimizationPublished by Springer Nature ,1988
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984