Ramsey partitions and proximity data structures

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

Volumn , Issue , 2006, Pages 109-118

  Mendel, Manor ^a   Naor, Assaf ^b  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NON-LINEAR ISOMORPHIC DVORETZKY THEOREM; RAMSEY PARTITIONS; STORAGE REQUIREMENT;

APPROXIMATION THEORY; QUERY PROCESSING; SET THEORY; THEOREM PROVING;

DATA STRUCTURES;

EID: 35448988431     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.65     Document Type: Conference Paper

References (28)

1. S. Arora, J. R. Lee, and A. Naor. Euclidean distortion and the sparsest cut. In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 553-562, New York, NY, USA, 2005. ACM Press.
2. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM, 45:891-923, 1998.
3. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear time construction of sparse neighborhood covers. SIAM J. Comput., 28(1):263-277, 1999.
4. Y Bartal. Probabilistic approximations of metric space and its algorithmic application. In 37th Annual Symposium on Foundations of Computer Science, pages 183-193, Oct. 1996.
5. Y Bartal, N. Linial, M. Mendel, and A. Naor. On metric Ramsey type phenomena. Ann. of Math. (2), 162(2):643-709, 2005.
6. M. A. Bender and M. Farach-Colton. The lea problem revisited. In Proc. 4th Latin Amer. Symp. on Theor. Info., pages 88-94. Springer-Verlag, 2000.
7. M. A. Bender and M. Farach-Colton. The level ancestor problem simplified. Theoretical Comput. Sci., 321(1):5-12, 2004.
8. J. Bourgain, T. Figiel, and V Milman. On Hilbertian subsets of finite metric spaces. Israel J Math, 55(2): 147-152, 1986.
9. G. Calinescu, H. Karloff, and Y. Rabani. Approximation algorithms for the 0-extension problem. SIAM J. Comput., 34(2):358-372 (electronic), 2004/05.
10. P.B.Callahan. Dealing with higher dimensions: the well-separated pair decomposition and its applications. Ph.D. thesis, Dept. Comput. Sci., Johns Hopkins University, Baltimore, Maryland, 1995.
11. P. B. Callahan and S. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM, 42(1):67-90, 1995.
12. K. L. Clarkson. Nearest-Neighbor Searching and Metric Space Dimensions. In Nearest-Neighbor Methods for Learning and Vision: Theory and Practice. MIT Press, 2005. Available at http://cm.bell-labs.com/who/clarkson/nn.survey/p. pdf.
13. E. Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput., 28(1):210-236, 1999.
14. P. Erdõs. Extremal problems in graph theory. In Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), pages 29-36. Publ. House Czechoslovak Acad. Sci., Prague, 1964.
15. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. System Sci., 69(3):485-497, 2004.
16. m smooth functions to data I. Preprint, availabe at http://www.math.princeton.edu/ facultypapers/Fefferman/FittingData_Part_I.pdf, 2005.
17. J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid. Approximate distance oracles for geometric graphs. In SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pages 828-837, Philadelphia, PA, USA, 2002. Society for Industrial and Applied Mathematics.
18. S. Har-Peled and M. Mendel. Fast construction of nets in low dimensional metrics, and their applications. SIAM J. Comput., pages 1143-1184, 2006.
19. D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM J. Comput., 13(2):338-355, 1984.
20. P. Indyk. Nearest neighbors in high-dimensional spaces. In Handbook of discrete and computational geometry, second edition, pages 877-892. CRC Press, Inc., Boca Raton, FL, USA, 2004.
21. R. Krauthgamer, J. R. Lee, M. Mendel, and A. Naor. Measured descent: A new embedding method for finite metrics. Geom. Funct. Anal., 15(4):839-858, 2005.
22. J. R. Lee and A. Naor. Extending Lipschitz functions via random metric partitions. Invent. Math., 160(1):59-95, 2005.
23. J. Matoušek. On the distortion required for embedding finite metric space into normed spaces. Israel J. Math., 93:333-344, 1996.
24. L. Roditty, M. Thorup, and U. Zwick. Deterministic constructions of approximate distance oracles and spanners. In Automata, languages and programming, volume 3580 of Lecture Notes in Comput. Sci., pages 261-272. Springer, Berlin, 2005.
25. K. Talwar. Bypassing the embedding: algorithms for low dimensional metrics. In STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 281-290, New York, NY, USA, 2004. ACM Press.
26. M. Thorup and U. Zwick. Approximate distance oracles. J. ACM, 52(1):1-24, 2005.
27. P. M. Vaidya. An O(n log n) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom., 4(2): 101-115, 1989.
28. U. Zwick. Exact and approximate distances in graphs - a survey. In Algorithms-ESA 2001 (Århus), volume 2161 of Lecture Notes in Comput. Sci., pages 33-48. Springer, Berlin, 2001.