Measured descent: A new embedding method for finite metrics

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 434-443

  Krauthgamer, Robert ^a   Lee, James R ^b   Mendel, Manor ^c   Naor, Assaf ^d  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^d MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECOMPOSABILITY; EUCLIDEAN SPACE; FINITE MATRICES; PROBABILITY MEASURE;

COMPUTATIONAL GEOMETRY; DISTORTION (WAVES); EMBEDDED SYSTEMS; PARAMETER ESTIMATION; PROBABILITY; THEOREM PROVING;

MATRIX ALGEBRA;

EID: 17844392651     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. +04] A. Archer, J. Fakcharoenphol, C. Harrelson, R. Krauthgamer, K. Talwar, and E. Tardos. Approximate classification via earthmover metrics. In 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1072-1080, January 2004.
2. [AR98] Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput., 27(1):291-301 (electronic), 1998.
3. [ARV04] S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings, and graph partitionings. In 36th Annual Symposium on the Theory of Computing, 2004.
4. n. Bull. Soc. Math. France, 111(4):429-448, 1983.
5. [Bar96] Y. Bartal. Probabilistic approximations of metric space and its algorithmic application. In 37th Annual Symposium on Foundations of Computer Science, pages 183-193, October 1996.
6. [BL00] Y. Benyaminiv and J. Lindenstrauss. Geometric nonlinear functional analysis. Vol. 1, volume 48 of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, RI, 2000.
7. [Bou85] J. Bourgain. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel J. Math., 52(1-2):46-52, 1985.
8. [CGR04] S. Chawla, A. Gupta, and Harald Räcke. An improved approximation to the sparsest cut. Submitted, 2004.
9. [CKR01] G. Calinescu, H. Karloff, and Y. Rabani. Approximation algorithms for the 0-extension problem. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 8-16, Philadelphia, PA, 2001. SIAM.
10. [DV01] J. Dunagan and S. Vempala. On Euclidean embeddings and bandwidth minimization. In Randomization, approximation, and combinatorial optimization, pages 229-240. Springer, 2001.
11. [Fei00] U. Feige. Approximating the bandwidth via volume respecting embeddings. J. Comput. System Sci., 60(3):510-539, 2000.
12. [FHRT03] J. Fakcharoenphol, C. Harrelson, S. Rao, and K. Talwar. An improved approximation algorithm for the 0-extension problem. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 257-265, New York, 2003. ACM.
13. [FRT03] J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 448-455, 2003.
14. [FT03] J. Fakcharoenphol and K. Talwar. An improved decomposition theorem for graphs excluding a fixed minor. In Proceedings of 6th Workshop on Approximation, Randomization, and Combinatorial Optimization, volume 2764 of Lecture Notes in Computer Science, pages 36-46. Springer, 2003.
15. [GKL03] A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In 44th Symposium on Foundations of Computer Science, pages 534-543, 2003.
16. [Gup00] A. Gupta. Embeddings of finite metrics. Ph.D. thesis, University of California, Berkeley, 2000.
17. [Hei01] J. Heinonen. Lectures on analysis on metric spaces. Universitext. Springer-Verlag, New York, 2001.
18. [Ind01] P. Indyk. Algorithmic applications of low-distortion geometric embeddings. In 42nd Annual Symposium on Foundations of Computer Science, pages 10-33. IEEE Computer Society, 2001.
19. [JL84] W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability (New Haven, Conn., 1982), pages 189-206. Amer. Math. Soc., Providence, RI, 1984.
20. [Joh48] F. John. Extremum problems with inequalities as subsidiary conditions. In Studies and Essays Presented to R. Courant on his 60th Birthday, January 8, 1948, pages 187-204. Interscience Publishers, Inc., New York, N. Y., 1948.
21. [KLM04] R. Krauthgamer, N. Linial, and A. Magen. Metric embeddings-beyond one-dimensional distortion. Discrete Comput. Geom., 31(3):339-356, 2004.
22. [KPR93] P. N. Klein, S. A. Plotkin, and S. Rao. Excluded minors, network decomposition, and multicommodity flow. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 682-690, 1993.
23. N. Bull. London Math. Soc., 34(6):667-676, 2002.
24. [Lar67] D. G. Larman. A new theory of dimension. Proc. London Math. Soc., 17:178-192, 1967.
25. p spaces. Submitted, 2004.
26. [LLR9S] N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
27. 1 : Dimension, snowflakes, and average distortion. In 6th Intern. Symp. of Latin American Theoretical Informatics, 2004.
28. [LN03] J. R. Lee and A. Naor. Extending Lipschitz functions via random metric partitions, 2003.
29. [LN04] J. R. Lee and A. Naor. Metric decomposition, smooth measures, and clustering. Preprint, 2004.
30. [LP01] U. Lang and C. Plaut. Bilipschitz embeddings of metric spaces into space forms. Geom. Dedicata, 87(1-3):285-307, 2001.
31. [LS93] N. Linial and M. Saks. Low diameter graph decompositions. Combinatorica, 13(4):441-454, 1993.
32. [Luu98] J. Luukkainen. Assouad dimension: antifractal metrization, porous sets, and homogeneous measures. J. Korean Math. Soc., 35(1):23-76, 1998.
33. [Mag02] A. Magen. Dimensionality reductions that preserve volumes and distance to affine spaces, and their algorithmic applications. In Randomization, approximation, and combinatorial optimization (RANDOM), Cambdrige, MA, 2002. Springer-Verlag.
34. [Mat02a] J. Matoušek. Lectures on discrete geometry, volume 212 of Graduate Texts in Mathematics. Springer-Verlag, New York, 2002.
35. [Mat02b] J. Matoušek. Open problems on embeddings of finite metric spaces. Available at http://kam.mff.cuni.cz/~matousek/haifaop.ps, 2002.
36. [Rao99] S. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In Proceedings of the 15th Annual Symposium on Computational Geometry, pages 300-306, New York, 1999. ACM.
37. [VK87] A. L. Vol'berg and S. V. Konyagin. On measures with the doubling condition. Izv. Akad. Nauk SSSR Ser. Mat., 51(3):666-675, 1987.