Simplex partitioning via exponential clocks and the multiway cut problem
Authors:
Open Access
- 1 June 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 535-544
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Expander flows, geometric embeddings and graph partitioningJournal of the ACM, 2009
- Vertex cover might be hard to approximate to withinJournal of Computer and System Sciences, 2008
- A tight bound on approximating arbitrary metrics by tree metricsJournal of Computer and System Sciences, 2004
- Multiway cuts in node weighted graphsJournal of Algorithms, 2004
- Approximation algorithms for classification problems with pairwise relationshipsJournal of the ACM, 2002
- A lower bound of on the integrality ratio of the Călinescu–Karloff–Rabani relaxation for multiway cutInformation Processing Letters, 2000
- Divide-and-conquer approximation algorithms via spreading metricsJournal of the ACM, 2000
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithmsJournal of the ACM, 1999
- Minimum 0-Extensions of Graph MetricsEuropean Journal of Combinatorics, 1998
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995