{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:54:41Z","timestamp":1725854081725},"publisher-location":"New York, NY","reference-count":16,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_294","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T19:36:49Z","timestamp":1553110609000},"page":"1570-1574","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","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","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"272_CR16304","doi-asserted-by":"crossref","unstructured":"Aronov B, de Berg M, Cheong O, Gudmundsson J, Haverkort H, Vigneron A (2005) Sparse geometric graphs with small dilation. In: Proceedings of the 16th international symposium on algorithms and computation. Lecture notes in computer science, vol 3827. Springer, Berlin, pp 50\u201359","DOI":"10.1007\/11602613_7"},{"key":"272_CR16305","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 (2005) Constructing plane spanners of bounded degree and low weight. Algorithmica 42:249\u2013264","journal-title":"Algorithmica"},{"key":"272_CR16306","doi-asserted-by":"publisher","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 (2004) Approximating geometric bottleneck shortest paths. Comput Geom Theory Appl 29:233\u2013249","journal-title":"Comput Geom Theory Appl"},{"key":"272_CR16307","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 (2004a) Competitive online routing in geometric graphs. Theor Comput Sci 324:273\u2013288","journal-title":"Theor Comput Sci"},{"key":"272_CR16308","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1137\/S0097539700369387","volume":"33","author":"P Bose","year":"2004","unstructured":"Bose P, Morin P (2004b) Online routing in triangulations. SIAM J Comput 33:937\u2013951","journal-title":"SIAM J Comput"},{"key":"272_CR16309","doi-asserted-by":"crossref","unstructured":"Bose P, Smid M, Xu D (2006) Diamond triangulations contain spanners of bounded degree. In: Proceedings of the 17th international symposium on algorithms and computation. Lecture notes in computer science, vol 4288. Springer, Berlin, pp 173\u2013182","DOI":"10.1007\/11940128_19"},{"key":"272_CR16310","doi-asserted-by":"crossref","unstructured":"Chew LP (1986) There is a planar graph almost as good as the complete graph. In: Proceedings of the 2nd ACM symposium on computational geometry, pp 169\u2013177","DOI":"10.1145\/10515.10534"},{"key":"272_CR16311","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"LP Chew","year":"1989","unstructured":"Chew LP (1989) There are planar graphs almost as good as the complete graph. J Comput Syst Sci 39:205\u2013219","journal-title":"J Comput Syst Sci"},{"key":"272_CR16312","doi-asserted-by":"crossref","unstructured":"Das G, Joseph D (1989) Which triangulations approximate the complete graph? In: Proceedings of the international symposium on optimal algorithms. Lecture notes in computer science, vol 401. Springer, Berlin, pp 168\u2013192","DOI":"10.1007\/3-540-51859-2_15"},{"key":"272_CR16313","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"DP Dobkin","year":"1990","unstructured":"Dobkin DP, Friedman SJ, Supowit KJ (1990) Delaunay graphs are almost as good as complete graphs. Discret Comput Geom 5:399\u2013407","journal-title":"Discret Comput Geom"},{"key":"272_CR16314","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0166-218X(00)00236-5","volume":"109","author":"RL Drysdale","year":"2001","unstructured":"Drysdale RL, McElfresh S, Snoeyink JS (2001) On exclusion regions for optimal triangulations. Discret Appl Math 109:49\u201365","journal-title":"Discret Appl Math"},{"key":"272_CR16315","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"JM Keil","year":"1992","unstructured":"Keil JM, Gutwin CA (1992) Classes of graphs which approximate the complete Euclidean graph. Discret Comput Geom 7:13\u201328","journal-title":"Discret Comput Geom"},{"key":"272_CR16316","unstructured":"Lee AW (2004) Diamonds are a plane graph's best friend. Master's thesis, School of Computer Science, Carleton University, Ottawa"},{"key":"272_CR16317","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01758846","volume":"8","author":"C Levcopoulos","year":"1992","unstructured":"Levcopoulos C, Lingas A (1992) There are planar graphs almost as good as the complete graphs and almost as cheap as minimums panning trees. Algorithmica 8:251\u2013256","journal-title":"Algorithmica"},{"key":"272_CR16318","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 (2004) Efficient construction of low weighted bounded degree planar spanner. Int J Comput Geom Appl 14:69\u201384","journal-title":"Int J Comput Geom Appl"},{"key":"272_CR16319","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric spanner networks","author":"G Narasimhan","year":"2007","unstructured":"Narasimhan G, Smid M (2007) Geometric spanner networks. Cambridge University Press, Cambridge"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_294","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T19:52:49Z","timestamp":1553111569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_294"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_294","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}