On average distortion of embedding metrics into the line and into L1
暂无分享,去创建一个
[1] Jiri Matousek,et al. Lectures on discrete geometry , 2002, Graduate texts in mathematics.
[2] Philip N. Klein,et al. Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.
[3] Yuri Rabinovich,et al. A Lower Bound on the Distortion of Embedding Planar Metrics into Euclidean Space , 2002 .
[4] Satish Rao,et al. Small distortion and volume preserving embeddings for planar and Euclidean metrics , 1999, SCG '99.
[5] Anupam Gupta,et al. Embedding k-outerplanar graphs into ℓ1 , 2003, SODA '03.
[6] Jiří Matoušek,et al. On dominatedl1 metrics , 2001 .
[7] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[8] M. Gromov. Metric Structures for Riemannian and Non-Riemannian Spaces , 1999 .
[9] Anupam Gupta,et al. Cuts, Trees and ℓ1-Embeddings of Graphs* , 2004, Comb..
[10] V. Milman,et al. Asymptotic Theory Of Finite Dimensional Normed Spaces , 1986 .
[11] J. Bourgain. On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .
[12] Piotr Indyk,et al. Algorithmic applications of low-distortion geometric embeddings , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.