The complexity of low-distortion embeddings between point sets

Christos Papadimitriou, Shmuel Safra

Research output: Contribution to conferencePaperpeer-review

Abstract

The first complexity and inapproximability results of the low-distortion embeddings problems between the point sets were discussed. It was proved 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. Certain algorithms and hardness results for non-geometric metrics were also derived. The results propose the complexity of minimum distortion in more general settings than those solved as an important open questions.

Original languageEnglish
Pages112-118
Number of pages7
StatePublished - 2005
Externally publishedYes
EventSixteenth Annual ACM-SIAM Symposium on Discrete Algorithms - Vancouver, BC, United States
Duration: 23 Jan 200525 Jan 2005

Conference

ConferenceSixteenth Annual ACM-SIAM Symposium on Discrete Algorithms
Country/TerritoryUnited States
CityVancouver, BC
Period23/01/0525/01/05

Fingerprint

Dive into the research topics of 'The complexity of low-distortion embeddings between point sets'. Together they form a unique fingerprint.

Cite this