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 |
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in graph theory and to Lipschitz extensions in Banach spaces; its generalization Metric Labeling is motivated by applications in computer vision. Researchers had proposed using earthmover metrics to get polynomial-time-solvable relaxations for these problems. A conjecture that has attracted much attention recently is that the integrality ratio for these relaxations is constant. We prove (1) that the integrality ratio of the earthmover relaxation for Metric Labeling is $\Omega(\log k)$ (which is asymptotically tight), $k$ being the number of labels, whereas the best previous lower bound on the integrality ratio was only constant; (2) that the integrality ratio of the earthmover relaxation for 0-Extension is $\Omega(\sqrt{\log k})$, $k$ being the number of terminals (it was known to be $O((\log k)/\log\log k)$), whereas the best previous lower bound was only constant; (3) that for no $\epsilon0$ is there a polynomial-time $O((\log n)^{1/4-\epsilon})$-approximation algorithm for 0-Extension, $n$ being the number of vertices, unless NP$\subseteq$DTIME$(n^{\mathrm{poly}(\log n)})$, whereas the strongest inapproximability result known before was only MAX SNP-hardness; and (4) that there is a polynomial-time approximation algorithm for 0-Extension with performance ratio $O(\sqrt{\mathrm{diam}(d)})$, where $\mathrm{diam}(d)$ is the ratio of the largest to smallest nonzero distances in the terminal metric.