Ramsey partitions and proximity data structures

Journal of the European Mathematical Society

Volumn 9, Issue 2, 2007, Pages 253-275

  Mendel, Manor ^a   Naor, Assaf ^b  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

^b NONE   (United States)

Author keywords

Approximate distance oracle; Metric Ramsey theorem; Proximity data structure

Indexed keywords

EID: 33846646989     PISSN: 14359855     EISSN: None     Source Type: Journal    
DOI: 10.4171/JEMS/79     Document Type: Article

References (33)

1. Arora, S., Lee, J. R., Naor, A.: Euclidean distortion and the sparsest cut. In: STOC '05: Proc. 37th Annual ACM Symposium on Theory of Computing, ACM Press, New York, 553-562 (2005) MR 2181659
2. Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., Wu, A. Y.: An optimal algorithm for approximate nearest neighbor searching. J. ACM 45, 891-923 (1998) Zbl 1065.68650 MR 1678846
3. Awerbuch, B., Berger, B., Cowen, L., Peleg, D.: Near-linear time construction of sparse neighborhood covers. SIAM J. Comput. 28, 263-277 (1999) Zbl 0943.05079 MR 1630481
4. Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic application. In: 37th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, 184-193 (1996) MR 1450616
5. Bartal, Y., Linial, N., Mendel, M., Naor, A.: On metric Ramsey type phenomena. Ann. of Math. (2) 162, 643-709 (2005) Zbl pre05042684 MR 2183280
6. Bender, M. A., Farach-Colton, M.: The lea problem revisited. In: Proc. 4th Latin Amer. Symp. on Theor. Info., Springer, 88-94 (2000) Zbl 0959.68133
7. Bender, M. A., Farach-Colton, M.: The level ancestor problem simplified. Theoret. Comput. Sci. 321, 5-12 (2004) Zbl 1068.68047 MR 2067397
8. Bourgain, J., Figiel, T., Milman, V.: On Hilbertian subsets of finite metric spaces. Israel J. Math. 55, 147-152 (1986) Zbl 0634.46008 MR 0868175
9. Calinescu, G., Karloff, H., Rabani, Y.: Approximation algorithms for the 0-extension problem. SIAM J. Comput. 34, 358-372 (2004/05) Zbl pre02135840 MR 2124008
10. Callahan, P. B.: Dealing with higher dimensions: the well-separated pair decomposition and its applications. Ph.D. thesis, Dept. Comput. Sci., Johns Hopkins Univ., Baltimore, MD (1995)
11. Callahan, P. B., Kosaraju, S.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM 42, 67-90 (1995) Zbl 0886.68078 MR 1370371
12. Chawla, S., Gupta, A., Räcke, H.: Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. In: SODA '05: Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (Philadelphia, PA), SIAM, 102-111 (2005)
13. Clarkson, K. L.: 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 [14] Cohen, E.: Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. Comput. 28, 210-236 (1999) Zbl 0915.68077 MR 1630461
14. Cormen, T. H., Leiserson, C. E., Rivest, R. L.: Introduction to Algorithms. MIT Press (1990) Zbl 1047.68161 MR 1066870
15. Erdo″s, P.: Extremal problems in graph theory. In: Theory of Graphs and its Applications (Smolenice, 1963), Publ. House Czechoslovak Acad. Sci., Prague, 29-36 (1964) Zbl 0161.20501 MR 0180500
16. Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. System Sci. 69, 485-497 (2004) Zbl 1071.68082 MR 2087946
17. m smooth functions to data I. Ann. of Math., to appear; available at http://www.math.princeton.edu/ facultypapers/Fefferman/FittingData_Part_I.pdf (2005)
18. Gudmundsson, J., Levcopoulos, C., Narasimhan, G., Smid, M.: Approximate distance oracles for geometric graphs. In: SODA '02: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (Philadelphia, PA, 2002), SIAM, 828-837 (2002) Zbl 1058.65028
19. Har-Peled, S., Mendel, M.: Fast construction of nets in low dimensional metrics and their applications. SIAM J. Comput. 35, 1148-1184 (2006) MR 2217141
20. Harel, D., Tarjan, R. E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13, 338-355 (1984) Zbl 0535.68022 MR 0739994
21. Heinonen, J.: Lectures on Analysis on Metric Spaces. Universitext, Springer, New York (2001) Zbl 0985.46008 MR 1800917
22. Indyk, P.: Nearest neighbors in high-dimensional spaces. In: Handbook of Discrete and Computational Geometry, 2nd ed., CRC Press, Boca Raton, FL, 877-892 (2004)
23. Krauthgamer, R., Lee, J. R., Mendel, M., Naor, A.: Measured descent: A new embedding method for finite metrics. Geom. Funct. Anal. 15, 839-858 (2005) Zbl pre02228663
24. Lee, J. R., Naor, A.: Extending Lipschitz functions via random metric partitions. Invent. Math. 160, 59-95 (2005) Zbl 1074.46004 MR 2129708
25. Matoušek, J.: On the distortion required for embedding finite metric space into normed spaces. Israel J. Math. 93, 333-344 (1996) Zbl 0851.46007 MR 1380650
26. Mendel, M., Naor, A.: Euclidean quotients of finite metric spaces. Adv. Math. 189, 451-494 (2004) Zbl pre02136510 MR 2101227
27. Orchard, M. T.: A fast nearest-neighbor search algorithm. In: ICASSP '91: Int. Conf. on Acoustics, Speech and Signal Processing, Vol. 4, 2297-3000 (1991)
28. Peleg, D.: Informative labeling schemes for graphs. Theoret. Comput. Sci. 340, 577-593 (2005) Zbl 1077.68078 MR 2160465
29. Roditty, L., Thorup, M., Zwick, U.: Deterministic constructions of approximate distance oracles and spanners. In: Automata, Languages and Programming, Lecture Notes in Comput. Sei. 3580, Springer, Berlin, 261-272 (2005) Zbl 1082.68087 MR 2184637
30. Talwar, K.: Bypassing the embedding: algorithms for low dimensional metrics. In: STOC '04: Proc. 36th Annual ACM Symposium on Theory of Computing (New York, 2004). ACM Press, 281-290 (2004)
31. Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52, 1-24 (2005) MR 2143683
32. Vaidya, P.M.: An O (n log n ) algorithm for the all-nearest-neighbors problem. Discrete Cornput. Geom. 4, 101-115 (1989) Zbl 0663.68058 MR 0973540
33. Zwick, U.: Exact and approximate distances in graphs - a survey. In: Algorithms - ESA 2001 (Århus), Lecture Notes in Comput. Sci. 2161, Springer, Berlin, 33-48 (2001) Zbl 1006.68543 MR 1913540