{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:28:34Z","timestamp":1743010114071,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_15","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:37:51Z","timestamp":1214505471000},"page":"40-43","source":"Crossref","is-referenced-by-count":2,"title":["Applications of Geometric Spanner Networks"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Gudmundsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giri","family":"Narasimhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1_15","first-page":"270","volume-title":"Proceedings of the 16th ACM Symposium on Computational Geometry","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Har-Peled, S., Karia, M.: Computing approximate shortest paths on convex polytopes. In: Proceedings of the 16th ACM Symposium on Computational Geometry, pp. 270\u2013279. ACM Press, New York (2000)"},{"key":"15_CR2_15","first-page":"514","volume-title":"Proceedings of the 4th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 1136, Berlin","author":"S. Arikati","year":"1996","unstructured":"Arikati, S., Chen, D.Z., Chew, L.P., Das, G., Smid, M., Zaroliagis, C.D.: Planar spanners and approximate shortest path queries among obstacles in the plane. In: Proceedings of the 4th Annual European Symposium on Algorithms. Lecture Notes in Computer Science, vol.\u00a01136, Berlin, pp. 514\u2013528. Springer, London (1996)"},{"key":"15_CR3_15","first-page":"271","volume-title":"Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms","author":"S. Baswana","year":"2004","unstructured":"Baswana, S., Sen, S.: Approximate distance oracles for unweighted graphs in $$ \\tilde{O}(n^2) $$ time. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 271\u2013280. ACM Press, New York (2004)"},{"key":"15_CR4_15","first-page":"88","volume-title":"Proceedings of the 4th Latin American Symposium on Theoretical Informatics. Lecture Notes in Computer Science, vol. 1776, Berlin","author":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Farach\u2010Colton, M.: The LCA problem revisited. In: Proceedings of the 4th Latin American Symposium on Theoretical Informatics. Lecture Notes in Computer Science, vol.\u00a01776, Berlin, pp. 88\u201394. Springer, London (2000)"},{"key":"15_CR5_15","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1142\/S0218195901000675","volume":"11","author":"D.Z. Chen","year":"2001","unstructured":"Chen, D.Z., Daescu, O., Klenk, K.S.: On geometric path query problems. Int. J.\u00a0Comput. Geom. Appl. 11, 617\u2013645 (2001)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"15_CR6_15","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1142\/S0218195997000193","volume":"7","author":"G. Das","year":"1997","unstructured":"Das, G., Narasimhan, G.: A\u00a0fast algorithm for constructing sparse Euclidean spanners. Int. J.\u00a0Comput. Geom. Appl. 7, 297\u2013315 (1997)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"15_CR7_15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00454-003-2925-6","volume":"30","author":"J. Gao","year":"2003","unstructured":"Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Discrete mobile centers. Discrete Comput. Geom. 30, 45\u201363 (2003)","journal-title":"Discrete Comput. Geom."},{"key":"15_CR8_15","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1137\/S0097539700382947","volume":"31","author":"J. Gudmundsson","year":"2002","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Fast greedy algorithms for constructing sparse geometric spanners. SIAM J.\u00a0Comput. 31, 1479\u20131500 (2002)","journal-title":"SIAM J. Comput."},{"key":"15_CR9_15","first-page":"828","volume-title":"Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms","author":"J. Gudmundsson","year":"2002","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G., Smid, M.: Approximate distance oracles for geometric graphs. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 828\u2013837. ACM Press, New York (2002)"},{"key":"15_CR10_15","first-page":"357","volume-title":"Proceedings of the 13th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 2518, Berlin","author":"J. Gudmundsson","year":"2002","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G., Smid, M.: Approximate distance oracles revisited. In: Proceedings of the 13th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol.\u00a02518, Berlin, pp. 357\u2013368. Springer, London (2002)"},{"key":"15_CR11_15","doi-asserted-by":"crossref","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G., Smid, M.: Approximate distance oracles for geometric spanners, ACM Trans. Algorithms (2008). To Appear","DOI":"10.1007\/978-0-387-30162-4_167"},{"key":"15_CR12_15","first-page":"508","volume-title":"Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 3404, Berlin","author":"J. Gudmundsson","year":"2005","unstructured":"Gudmundsson, J., Narasimhan, G., Smid, M.: Fast pruning of geometric spanners. In: Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol.\u00a03404, Berlin, pp.\u00a0508\u2013520. Springer, London (2005)"},{"key":"15_CR13_15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G. Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks, Cambridge University Press, Cambridge, UK (2007)"},{"key":"15_CR14_15","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"M. Thorup","year":"2004","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. J.\u00a0ACM 51, 993\u20131024 (2004)","journal-title":"J. ACM"},{"key":"15_CR15_15","first-page":"183","volume-title":"Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing","author":"M. Thorup","year":"2001","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. In: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pp. 183\u2013192. ACM Press, New York (2001)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T02:00:18Z","timestamp":1662170418000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_15"}},"subtitle":["2002; Gudmundsson, Levcopoulos, Narasimhan, Smid"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_15","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}