{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:01:46Z","timestamp":1725483706179},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441588"},{"type":"electronic","value":"9783540457350"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45735-6_26","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T17:12:38Z","timestamp":1178212358000},"page":"298-309","source":"Crossref","is-referenced-by-count":13,"title":["t-Spanners as a Data Structure for Metric Space Searching"],"prefix":"10.1007","author":[{"given":"Gonzalo","family":"Navarro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edgar","family":"Ch\u00e1vez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"26_CR1","unstructured":"R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley, 1999."},{"key":"26_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 9th International Symposium on String Processing and Information Retrieval (SPIRE 2002)","author":"B. Bustos","year":"2002","unstructured":"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."},{"key":"26_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-44808-X_12","volume-title":"Proc. 3rd Workshop on Algorithm Engineering and Experiments (ALENEX\u201901)","author":"E. Ch\u00e1vez","year":"2001","unstructured":"E. Ch\u00e1vez and G. Navarro. A probabilistic spell for the curse of dimensionality. In Proc. 3rd Workshop on Algorithm Engineering and Experiments (ALENEX\u201901), LNCS 2153, pages 147\u2013160, 2001."},{"issue":"3","key":"26_CR4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"E. Ch\u00e1vez, G. Navarro, R. Baeza-Yates, and J. L. Marroquin. Proximity searching in metric spaces. A CM Computing Surveys, 33(3):273\u2013321, September 2001.","journal-title":"A CM Computing Surveys"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539794261295","volume":"28","author":"E. Cohen","year":"1998","unstructured":"E. Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM J. on Computing, 28:210\u2013236, 1998.","journal-title":"t. SIAM J. on Computing"},{"issue":"2","key":"26_CR6","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"V. Gaede and O. G\u00fcnther. Multidimensional access methods. ACM Computing Surveys, 30(2):170\u2013231, 1998.","journal-title":"ACM Computing Surveys"},{"key":"26_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/3-540-44985-X_28","volume-title":"Proc. 7th Scandinavian Workshop on Algorithm Theory (SWAT 2000)","author":"J. Gudmundsson","year":"2000","unstructured":"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\u2013327, 2000."},{"key":"26_CR8","unstructured":"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."},{"issue":"1","key":"26_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D. Peleg","year":"1989","unstructured":"D. Peleg and A. Schaffer. Graph spanners. Journal of Graph Theory, 13(1):99\u2013116, 1989.","journal-title":"Journal of Graph Theory"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"E. Vidal","year":"1986","unstructured":"E. Vidal. An algorithm for finding nearest neighbors in (approximately) constant average time. Patt. Recog. Lett., 4:145\u2013157, 1986.","journal-title":"Patt. Recog. Lett."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45735-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T16:12:38Z","timestamp":1547741558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45735-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441588","9783540457350"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45735-6_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}