t-spanners as a data structure for metric space searching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2476, Issue , 2002, Pages 298-309

  Navarro, Gonzalo ^a   Paredes, Rodrigo ^a   Chávez, Edgar ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSIDAD MICHOACANA DE SAN NICOLÁS DE HIDALGO   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DATA STRUCTURES; ECONOMIC AND SOCIAL EFFECTS; INFORMATION RETRIEVAL; SET THEORY; TOPOLOGY;

COMPACT DEVICES; COMPLETE GRAPHS; GRAPH DISTANCES; METRIC SPACE SEARCHING; METRIC SPACES; SPACE REQUIREMENTS; SPACE-TIME TRADEOFFS; SUCCESSFUL SEARCH;

GRAPH THEORY;

EID: 84958754419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45735-6_26     Document Type: Conference Paper

References (10)

1. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison- Wesley, 1999.
2. B. Bustos and G. Navarro. Probabilistic proximity searching algorithms based on compact partitions. In Proc. 9th International Symposium on String Processing and Information Retrieval (SPIRE 2002), LNCS. Springer, 2002. To appear.
3. E. Chávez and G. Navarro. A probabilistic spell for the curse of dimensionality. In Proc. 3rd Workshop on Algorithm Engineering and Experiments (ALENEX’01), LNCS 2153, pages 147–160, 2001.
4. E. Chávez, G. Navarro, R. Baeza-Yates, and J. L. Marroquin. Proximity searching in metric spaces. ACM Computing Surveys, 33(3):273–321, September 2001.
5. E. Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. on Computing, 28:210–236, 1998.
6. V. Gaede and O. Günther. Multidimensional access methods. ACM Computing Surveys, 30(2):170–231, 1998.
7. J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Improved greedy algorithms for constructing sparse geometric spanners. In Proc. 7th Scandinavian Workshop on Algorithm Theory (SWAT 2000), LNCS v. 1851, pages 314–327, 2000.
8. G. Navarro and R. Paredes. Practical construction of metric t-spanners. Technical Report TR/DCC-2002-4, Dept. of Computer Science, Univ. of Chile, July 2002.
9. D. Peleg and A. Schaffer. Graph spanners. Journal of Graph Theory, 13(1):99–116, 1989.
10. E. Vidal. An algorithm for finding nearest neighbors in (approximately) constant average time. Patt. Recog. Lett., 4:145–157, 1986.