On earthmover distance, metric labeling, and 0-extension

DOI10.1145/1132516.1132595zbMath1301.68148MaRDI QIDQ2931417

Yuval Rabani, Subhash A. Khot, Aranyak Mehta, Howard J. Karloff

Publication date: 25 November 2014

Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1132516.1132595

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms