Christos Papadimitriou, Shmuel Safra  Home/Search
Context
Related
| math.tau.ac.il/~safra/Paper...points.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.tau.ac.il/~safra/ (more) Homepages: S.Safra |
Rate this article:      (best)Comment on this article |
Abstract: We prove that it is NP-hard to approximate by a ratio better than 3 the minimum distortion of a bijection between two given finite three-dimensional sets of points. (Update)
Similar documents based on text: More All
0.4: The Complexity of Low-Distortion Embeddings between Point Sets - Papadimitriou, Safra (Correct)
0.2: Approximating-CVP to Within Almost-Polynomial Factors is.. - Dinur, Kindler, Safra (1998) (Correct)
0.2: Extractors from Reed-Muller Codes - Ta-Shma, Zuckerman, Safra (2003) (Correct)
BibTeX entry: (Update)
@misc{ papadimitriou-complexity,
author = "Christos Papadimitriou and Shmuel Safra",
title = "The Complexity of Low-Distortion Embeddings between Point Sets",
url = "citeseer.ist.psu.edu/705507.html" }
Citations (may not include all citations):187 Polynomial Time Approximation Schemes for Euclidean Travelin.. - Arora - 1998
165 Approximate nearest neighbors: towards removing the curse of.. - Indyk, Motwani - 1998
91 Two algorithms for nearest-neighbor search in high dimension.. - Kleinberg - 1997
79 Extensions of Lipschitz mappings into a hilbert space (context) - Johnson, Lindenstrauss - 1984
76 Shape Matching and Object Recognition Using Shape Contexts - Belongie, Malik et al. - 2002
27 Algorithmic Applications of Low-Distortion Geometric Embeddi.. (context) - Indyk - 2001
23 similarity and symmetries of geometric objects (context) - Alt, Mehlhorn et al. - 1988
17 An optimal algorithm for geometrical congruence (context) - Atkinson - 1987
17 An Algorithmic Theory of Learning: Robust Concepts and Rando.. (context) - Arriaga, Vempala - 1999
11 Approximation Algorithms for the Bandwidth Minimization Prob.. (context) - Haralambides, Makedon - 1997
3 Competitive concurrent distributed queuing - Herlihy, Tirthapura et al. - 2001
2 Low Distortion Maps Between Point Sets (context) - Kenyon, Rabani et al. - 2004
2 Expander flows and a sqrtlog n-approximation to sparsest cut (context) - Arora, Rao et al. - 2004
2 Papadimitriou: The Euclidean Traveling Salesman Problem is N.. (context) - Christos - 1977
Documents on the same site (http://www.math.tau.ac.il/~safra/): More
PCP Characterizations of NP: Towards a.. - Dinur, Fischer.. (1999) (Correct)
Approximating-CVP to Within Almost-Polynomial Factors is.. - Dinur, Kindler, Safra (1998) (Correct)
On the Complexity of the Catalog-Segmentation Problem - Asodi, Safra (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC