Low-Distortion Embeddings of Finite Metric Spaces

[1]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.

[2]  Assaf Naor,et al.  Ramsey partitions and proximity data structures , 2005, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[3]  Sanjeev Arora,et al.  Euclidean distortion and the sparsest cut , 2005, STOC '05.

[4]  Anupam Gupta,et al.  Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut , 2005, SODA '05.

[5]  Shang-Hua Teng,et al.  Lower-stretch spanning trees , 2004, STOC '05.

[6]  Béla Bollobás,et al.  Ramsey-type theorems for metric spaces with applications to online problems , 2004, J. Comput. Syst. Sci..

[7]  Kenneth Ward Church,et al.  Nonlinear Estimators and Tail Bounds for Dimension Reduction in l1 Using Cauchy Random Projections , 2006, J. Mach. Learn. Res..

[8]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[9]  Nathan Linial,et al.  On metric ramsey-type phenomena , 2003, STOC '03.

[10]  Venkatesan Guruswami,et al.  Embeddings and non-approximability of geometric problems , 2003, SODA '03.

[11]  Ilan Newman,et al.  A Lower Bound on the Distortion of Embedding Planar Metrics into Euclidean Space , 2002, SCG '02.

[12]  Ryan O'Donnell,et al.  Derandomized dimensionality reduction with applications , 2002, SODA '02.

[13]  Jirí Matousek,et al.  Low-Distortion Embeddings of Trees , 2001, J. Graph Algorithms Appl..

[14]  Santosh S. Vempala,et al.  On Euclidean Embeddings and Bandwidth Minimization , 2001, RANDOM-APPROX.

[15]  Graham Cormode,et al.  Permutation Editing and Matching via Embeddings , 2001, ICALP.

[16]  Dimitris Achlioptas,et al.  Database-friendly random projections , 2001, PODS.

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

[18]  S. Muthukrishnan,et al.  Approximate nearest neighbors and sequence comparison with block operations , 2000, STOC '00.

[19]  J. Matousek,et al.  On embedding trees into uniformly convex Banach spaces , 1999 .

[20]  Anupam Gupta,et al.  Cuts, Trees and ℓ1-Embeddings of Graphs* , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[21]  Anupam Gupta,et al.  Embedding Tree Metrics into Low-Dimensional Euclidean Spaces , 1999, STOC '99.

[22]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[23]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[24]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[25]  Michiel H. M. Smid,et al.  Euclidean spanners: short, thin, and lanky , 1995, STOC '95.

[26]  Noga Alon,et al.  A Graph-Theoretic Game and Its Application to the k-Server Problem , 1995, SIAM J. Comput..

[27]  David P. Dobkin,et al.  On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..

[28]  Sergey V. Shpectorov,et al.  On Scale Embeddings of Graphs into Hypercubes , 1993, Eur. J. Comb..

[29]  A. Dress,et al.  A canonical decomposition theory for metrics on a finite set , 1992 .

[30]  D. Djoković.  Distance-preserving subgraphs of hypercubes , 1973 .

[31]  U. Zwick,et al.  Approximate distance oracles , 2001, STOC '01.

[32]  Christopher M. Hartman.  Extremal problems in graph theory , 1997 .

[33]  Hans-Jürgen Bandelt,et al.  Embedding metric spaces in the rectilinear plane: A six-point criterion , 1996, Discret. Comput. Geom..

[34]  J. Matousek,et al.  Bi-Lipschitz embeddings into low-dimensional Euclidean spaces , 1990 .