On earthmover distance, metric labeling, and 0-extension

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 547-556

  Karloff, Howard ^a   Khot, Subhash ^b   Mehta, Aranyak ^c   Rabani, Yuval ^d  

^a AT AND T LABS RESEARCH   (United States)

^b Georgia Institute of Technology   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Algorithms; Theory

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; INTEGRAL EQUATIONS; POLYNOMIALS;

APPROXIMATION ALGORITHM; EARTHMOVER RELAXATION; INTEGRALITY RATIO; LIPSCHITZ EXTENSIONS;

PROBLEM SOLVING;

EID: 33748120676     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132595     Document Type: Conference Paper

References (25)

1. A. Archer, J. Fakcharoenphol, C. Harrelson, R. Krauthgamer, K. Talwar, and É. Tardos, Approximate classification via earthmover metrics, in Proc. SODA '04.
2. Y. Aumann and Y. Rabani, An O(log k) approximate min-cut max-flow theorem and approximation algorithm, SIAM J. Comput., 27(1):291-301, 1998.
3. Y. Bartal, On approximating arbitrary metrics by tree metrics, in Proc. STOC '98.
4. J. Bourgain, The metrical interpretation of superreflexivity in Banach spaces, Israel J. Math., 56(2):222-230, 1986.
5. G. Calinescu, H. J. Karloff, and Y. Rabani, An improved approximation algorithm for MULTIWAY CUT, J. Comput. and Syst. Sci., 60(3):564-574, 2000
6. preliminary version in STOC '98.
7. G. Calinescu, H. J. Karloff, and Y. Rabani, Approximation algorithms for the 0-EXTENSION problem, SIAM J. Comput., 34(2):358-372, 2004
8. preliminary version in SODA '01.
9. M. Charikar, private communication, 2000.
10. C. Chekuri, S. Khanna, J. Naor, and L. Zosin, Approximation algorithms for the METRIC LABELING problem via a new linear programming formulation, to appear in SIAM J. on Discrete Math
11. preliminary version in SODA '01.
12. J. Chuzhoy and J. Naor, The hardness of METRIC LABELING, in Proc. FOCS '04, 108-114.
13. J. Fakcharoenphol, C. Harrelson, S. Rao, and K. Talwar, An improved approximation algorithm for the 0-EXTENSION PROBLEM, in Proc. SODA '03, 342-352.
14. J. Fakcharoenphol, S. Rao, and K. Talwar, A tight bound on approximating arbitrary metrics by tree metrics, in Proc. STOC '03, 448-455.
15. A. Gupta and E. Tardos, A constant factor approximation algorithm for a class of classification problems, in Proc. STOC '00, pages 652-658.
16. W. B. Johnson, J. Lindenstrauss, and G. Schechtman, Extensions of Lipschitz maps into Banach space, Israel J. Math., 54(2):129-138, 1986.
17. A. V. Karzanov, Minimum 0-extension of graph metrics, Europ. J. Combinat., 19:71-101, 1998.
18. R. Krauthgamer, J. Lee, M. Mendel, and A. Naor, "Measured Descent: A New Embedding Method For Finite Metrics," Geometric and Functional Analysis 15 (4), 839-858, 2005.
19. A preliminary version appeared in FOCS 2004.
20. S. Khot and A. Naor, Nonembeddability theorems via Fourier analysis, in Proc. FOCS '05.
21. J. Kleinberg and E. Tardos. Approximation algorithms for classification problems with pairwise relationships: METRIC LABELING and Markov random fields, J. Assoc. Comput. Mach., 49:616-639, 2002
22. preliminary version in FOCS '99.
23. J. R. Lee and A. Naor, Extending Lipschitz functions via random metric partitions, Math. Invent., 160(1): 59-95, 2005.
24. N. Linial, E. London, and Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combinatorica 15(2):215-245, 1995
25. preliminary version in FOCS '94.