The complexity of multiway cuts (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
An improved approximation algorithm for multiway cut
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Minimum 0-extensions of graph metrics
European Journal of Combinatorics
Rounding algorithms for a geometric embedding of minimum multiway cut
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A constant factor approximation algorithm for a class of classification problems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Approximation algorithms for the 0-extension problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for the metric labeling problem via a new linear programming formulation
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Similarity estimation techniques from rounding algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximate classification via earthmover metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating metrics by tree metrics
ACM SIGACT News
Bypassing the embedding: algorithms for low dimensional metrics
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On earthmover distance, metric labeling, and 0-extension
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Local embeddings of metric spaces
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
How to complete a doubling metric
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Extensions and limits to vertex sparsification
Proceedings of the forty-second ACM symposium on Theory of computing
Genus and the geometry of the cut graph
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Vertex sparsifiers: new results from old techniques
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Simplex partitioning via exponential clocks and the multiway cut problem
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Given a graph G = (V, E), a set of terminals T ⊆ V, and a metric D on T, the 0-extension problem is to assign vertices in V to terminals, so that the sum, over all edges e, of the distance (under D) between the terminals to which the end points of e are assigned, is minimized. This problem was first studied by Karzanov. Calinescu, Karloff and Rabani gave an O(logk) approximation algorithm based on a linear programming relaxation for the problem, where k is the number of terminals. We improve on this bound, and give an O(log k/log log k) approximation algorithm for the problem.