Sciweavers

2 search results - page 1 / 1
» On earthmover distance, metric labeling, and 0-extension
Sort
View
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
15 years 9 months ago
On earthmover distance, metric labeling, and 0-extension
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 grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
14 years 10 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani