{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:26:17Z","timestamp":1742988377013,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":16,"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_294","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:30:15Z","timestamp":1214505015000},"page":"653-656","source":"Crossref","is-referenced-by-count":0,"title":["Planar Geometric Spanners"],"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":"294_CR1_294","first-page":"50","volume-title":"Proceedings of the 16th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 3827","author":"B. Aronov","year":"2005","unstructured":"Aronov, B., de Berg, M., Cheong, O., Gudmundsson, J., Haverkort, H., Vigneron, A.: Sparse geometric graphs with small dilation. In: Proceedings of the 16th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol.\u00a03827, pp.\u00a050\u201359. Springer, Berlin (2005)"},{"key":"294_CR2_294","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00453-005-1168-8","volume":"42","author":"P. Bose","year":"2005","unstructured":"Bose, P., Gudmundsson, J., Smid, M.: Constructing plane spanners of bounded degree and low weight. Algorithmica 42, 249\u2013264 (2005)","journal-title":"Algorithmica"},{"key":"294_CR3_294","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.comgeo.2004.04.003","volume":"29","author":"P. Bose","year":"2004","unstructured":"Bose, P., Maheshwari, A., Narasimhan, G., Smid, M., Zeh, N.: Approximating geometric bottleneck shortest paths. Comput. Geom.: Theory Appl. 29, 233\u2013249 (2004)","journal-title":"Comput. Geom.: Theory Appl."},{"key":"294_CR4_294","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2004.05.019","volume":"324","author":"P. Bose","year":"2004","unstructured":"Bose, P., Morin, P.: Competitive online routing in geometric graphs. Theor. Comput. Sci. 324, 273\u2013288 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"294_CR5_294","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1137\/S0097539700369387","volume":"33","author":"P. Bose","year":"2004","unstructured":"Bose, P., Morin, P.: Online routing in triangulations. SIAM J. Comput. 33, 937\u2013951 (2004)","journal-title":"SIAM J. Comput."},{"key":"294_CR6_294","first-page":"173","volume-title":"Proceedings of the 17th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 4288","author":"P. Bose","year":"2006","unstructured":"Bose, P., Smid, M., Xu, D.: Diamond triangulations contain spanners of bounded degree. In: Proceedings of the 17th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol.\u00a04288, pp.\u00a0173\u2013182. Springer, Berlin (2006)"},{"key":"294_CR7_294","doi-asserted-by":"crossref","unstructured":"Chew, L.P.: There is a\u00a0planar graph almost as good as the complete graph. In: Proceedings of the 2nd ACM Symposium on Computational Geometry, pp.\u00a0169\u2013177 (1986)","DOI":"10.1145\/10515.10534"},{"key":"294_CR8_294","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"L.P. Chew","year":"1989","unstructured":"Chew, L.P.: There are planar graphs almost as good as the complete graph. J.\u00a0Comput. Syst. Sci. 39, 205\u2013219 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"294_CR9_294","first-page":"168","volume-title":"Proceedings of the International Symposium on Optimal Algorithms. Lecture Notes in Computer Science, vol. 401","author":"G. Das","year":"1989","unstructured":"Das, G., Joseph, D.: Which triangulations approximate the complete graph? In: Proceedings of the International Symposium on Optimal Algorithms. Lecture Notes in Computer Science, vol.\u00a0401, pp.\u00a0168\u2013192. Springer, Berlin (1989)"},{"key":"294_CR10_294","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"D.P. Dobkin","year":"1990","unstructured":"Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discret. Comput. Geom. 5, 399\u2013407 (1990)","journal-title":"Discret. Comput. Geom."},{"key":"294_CR11_294","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0166-218X(00)00236-5","volume":"109","author":"R.L. Drysdale","year":"2001","unstructured":"Drysdale, R.L., McElfresh, S., Snoeyink, J.S.: On exclusion regions for optimal triangulations. Discrete Appl. Math. 109, 49\u201365 (2001)","journal-title":"Discrete Appl. Math."},{"key":"294_CR12_294","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"J.M. Keil","year":"1992","unstructured":"Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discrete Comput. Geom. 7, 13\u201328 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"294_CR13_294","unstructured":"Lee, A.W.: Diamonds are a\u00a0plane graph's best friend. Master's thesis, School of Computer Science, Carleton University, Ottawa (2004)"},{"key":"294_CR14_294","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01758846","volume":"8","author":"C. Levcopoulos","year":"1992","unstructured":"Levcopoulos, C., Lingas, A.: There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica 8, 251\u2013256 (1992)","journal-title":"Algorithmica"},{"key":"294_CR15_294","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1142\/S0218195904001366","volume":"14","author":"X.-Y. Li","year":"2004","unstructured":"Li, X.-Y., Wang, Y.: Efficient construction of low weighted bounded degree planar spanner. Int. J.\u00a0Comput. Geom. Appl. 14, 69\u201384 (2004)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"294_CR16_294","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)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_294","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:22:00Z","timestamp":1662175320000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_294"}},"subtitle":["2005; Bose, Smid, Gudmundsson"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_294","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}