Approximating the Distortion

Kenyon et al. (STOC 04) compute the distortion between one-dimensional finite point sets when the distortion is small; Papadimitriou and Safra (SODA 05) show that the problem is NP-hard to approximate within a factor of 3, albeit in 3 dimensions. We solve an open problem in these two papers by demonstrating that, when the distortion is large, it is hard to approximate within large factors, even for 1-dimensional point sets. We also introduce additive distortion, and show that it can be easily approximated within a factor of two.

[1]  Nathan Linial.  Finite metric spaces: combinatorics, geometry and algorithms , 2002, SCG '02.

[2]  Yuval Rabani,et al.  Low distortion maps between point sets , 2004, STOC '04.

[3]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[4]  Aleksandrs Slivkins,et al.  Distributed approaches to triangulation and embedding , 2005, SODA '05.

[5]  Jon M. Kleinberg,et al.  Triangulation and embedding using small sets of beacons , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[6]  G. Italiano,et al.  Algorit[h]ms - ESA '98 : 6th Annual European Symposium, Venice, Italy, August 24-26, 1998 : proceedings , 1998 .

[7]  J. Bourgain.  On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .

[8]  Mihai Badoiu,et al.  Approximation algorithms for low-distortion embeddings into low-dimensional spaces , 2005, SODA '05.

[9]  Tatsuya Akutsu,et al.  Point matching under non-uniform distortions , 2003, Discret. Appl. Math..

[10]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[11]  Piotr Indyk,et al.  Algorithmic applications of low-distortion geometric embeddings , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[12]  Christos H. Papadimitriou,et al.  The complexity of low-distortion embeddings between point sets , 2005, SODA '05.

[13]  Johan Håstad,et al.  Fitting points on the real line and its application to RH mapping , 2003, J. Algorithms.

[14]  Uriel Feige,et al.  Approximating the Bandwidth via Volume Respecting Embeddings , 2000, J. Comput. Syst. Sci..

[15]  Mihai Badoiu,et al.  Approximation algorithm for embedding metrics into a two-dimensional space , 2003, SODA '03.