{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:14Z","timestamp":1759637954468,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T00:00:00Z","timestamp":1489968000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s00453-017-0305-5","type":"journal-article","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T10:18:06Z","timestamp":1490005086000},"page":"935-976","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Improved Spanning Ratio for Low Degree Plane Spanners"],"prefix":"10.1007","volume":"80","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5210-7112","authenticated-orcid":false,"given":"Darryl","family":"Hill","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":[[2017,3,20]]},"reference":[{"key":"305_CR1","volume-title":"Euclidean Geometry and Convexity","author":"RV Benson","year":"1966","unstructured":"Benson, R.V.: Euclidean Geometry and Convexity. McGraw-Hill, New York (1966)"},{"key":"305_CR2","doi-asserted-by":"crossref","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Perkovi\u0107, L.: Plane spanners of maximum degree six. In: Abramsky, S., Gavoille, C., Kirchner, C., auf\u00a0der Heide, F.M., Spirakis, P. (eds.) Automata, Languages and Programming, Volume 6198 of Lecture Notes in Computer Science, pp. 19\u201330. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-14165-2_3"},{"issue":"3","key":"305_CR3","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/s00454-015-9676-z","volume":"53","author":"N Bonichon","year":"2015","unstructured":"Bonichon, N., Kanj, I., Perkovi\u0107, L., Xia, G.: There are plane spanners of degree 4 and moderate stretch factor. Discrete Comput. Geom. 53(3), 514\u2013546 (2015)","journal-title":"Discrete Comput. Geom."},{"key":"305_CR4","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.jda.2012.03.004","volume":"15","author":"P Bose","year":"2012","unstructured":"Bose, P., Carmi, P., Chaitman-Yerushalmi, L.: On bounded degree plane strong geometric spanners. J. Discrete Algorithms 15, 16\u201331 (2012)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"305_CR5","doi-asserted-by":"crossref","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 lowweight. Algorithmica 42(3), 249\u2013264 (2005)","journal-title":"Algorithmica"},{"key":"305_CR6","doi-asserted-by":"crossref","unstructured":"Bose, P., Keil, J.M.: On the stretch factor of the constrained Delaunay triangulation. In: 3rd International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2006, Banff, Alberta, Canada, July 2\u20135, 2006, pp. 25\u201331. IEEE Computer Society (2006)","DOI":"10.1109\/ISVD.2006.28"},{"key":"305_CR7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1142\/S0218195909002861","volume":"19","author":"P Bose","year":"2009","unstructured":"Bose, P., Smid, M.H.M., Xu, D.: Delaunay and diamond triangulations contain spanners of bounded degree. Int. J. Comput. Geom. Appl. 19, 119\u2013140 (2009)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"305_CR8","doi-asserted-by":"crossref","unstructured":"Chew, P: There is a planar graph almost as good as the complete graph. In: Proceedings of the Second Annual Symposium on Computational Geometry, SCG \u201986, pp. 169\u2013177. ACM, New York, NY, USA (1986)","DOI":"10.1145\/10515.10534"},{"issue":"1","key":"305_CR9","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"DP Dobkin","year":"1990","unstructured":"Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom. 5(1), 399\u2013407 (1990)","journal-title":"Discrete Comput. Geom."},{"key":"305_CR10","unstructured":"Kanj, I., Perkovic, L., T\u00fcrkoglu, D.: Degree four plane spanners: simpler and better. In: Fekete, S., Lubiw, A. (eds.) 32nd International Symposium on Computational Geometry (SoCG 2016), Volume\u00a051 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 45:1\u201345:15, Dagstuhl, Germany. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"6","key":"305_CR11","doi-asserted-by":"crossref","first-page":"2132","DOI":"10.1137\/080737708","volume":"39","author":"IA Kanj","year":"2010","unstructured":"Kanj, I.A., Perkovi\u0107, L., Xia, G.: On spanners and lightweight spanners of geometric graphs. SIAM J. Comput. 39(6), 2132\u20132161 (2010)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"305_CR12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"JM Keil","year":"1992","unstructured":"Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete euclidean graph. Discrete Comput. Geom. 7(1), 13\u201328 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"305_CR13","doi-asserted-by":"crossref","unstructured":"Li, X.-Y., Wang, Y.: Efficient construction of low weight bounded degree planar spanner. In: Warnow, T., Zhu, B. (eds.) Computing and Combinatorics, Volume 2697 of Lecture Notes in Computer Science, pp. 374\u2013384. Springer, Berlin (2003)","DOI":"10.1007\/3-540-45071-8_38"},{"issue":"4","key":"305_CR14","doi-asserted-by":"crossref","first-page":"1620","DOI":"10.1137\/110832458","volume":"42","author":"G Xia","year":"2013","unstructured":"Xia, G.: The stretch factor of the delaunay triangulation is less than 1.998. SIAM J. Comput. 42(4), 1620\u20131659 (2013)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0305-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0305-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0305-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T20:17:33Z","timestamp":1568924253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0305-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,20]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["305"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0305-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,3,20]]}}}