Hardness of embedding metric spaces of equal size

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4627 LNCS, Issue , 2007, Pages 218-227

  Khot, Subhash ^a   Sake, Rishi ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; OPTIMIZATION; PROBLEM SOLVING;

METRIC SPACES;

EMBEDDED SYSTEMS;

EID: 38049011004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74208-1_16     Document Type: Conference Paper

References (15)

1. Arora, S.: Polynomial time approximation schemes for Euclidean Traveling Salesman and other Geometric problems. Journal of the ACM 45(5), 753-782 (1998)
2. Arora, S., Lund, C., Motawani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM 45(3), 501-555 (1998)
3. Arora, S., Lee, J.R., Naor, A.: Euclidean distortion and the sparsest cut. In: Proc. STOC, pp. 553-562 (2005)
4. Arora, S., Rao, S., Vazirani, U.V.: Expander flows, geometric embeddings and graph partitioning. In: Proc. STOC, pp. 222-231 (2004)
5. Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM 45(1), 70-122 (1998)
6. Badoiu, M., Chuzhoy, J., Indyk, P., Sidiropoulos, A.: Low-distortion embeddings of general metrics into the line. In: Proc. STOC, pp. 225-233 (2005)
7. Bartal, Y.: On approximating arbitrary metrices by tree metrics. In: Proc. STOC, pp. 161-168 (1998)
8. Bourgain, J.: On Lipschitz embeddings of finite metrics in Hubert space. Israel Journal of Mathematics 52, 46-52 (1985)
9. Chekuri, C., Khanna, S., Naor, J., Zosin, L.: Approximation algorithms for the metric labeling problem via a new linear programming formulation. In: Proc. SODA, pp. 109-118 (2001)
10. Chuzhoy, J., Naor, J.: The hardness of Metric Labeling. In: Proc. FOCS, pp. 108-114 (2004)
11. Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3), 485-497 (2004)
12. Indyk, P.: Algorithmic applications of low-distortion embeddings. In: Proc. FOCS, pp. 10-33 (2001)
13. Kleinberg, J., Tardos, E.: Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. Journal of the ACM 49, 616-630 (2002)
14. Kenyon, C., Rabani, Y., Sinclair, A.: Low distortion maps between point sets. In: Proc. STOC, pp. 272-280 (2004)
15. Papadimitriou, C.H., Safra, S.: The complexity of low-distortion embeddings between point sets. In: Proc. SODA, pp. 112-118 (2005)