{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:29:49Z","timestamp":1742383789615},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441809"},{"type":"electronic","value":"9783540457497"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_24","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:42:44Z","timestamp":1183563764000},"page":"234-246","source":"Crossref","is-referenced-by-count":21,"title":["Constructing Plane Spanners of Bounded Degree and Low Weight"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Gudmundsson","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":[[2002,8,29]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"731","DOI":"10.4153\/CJM-1966-073-4","volume":"18","author":"D. Barnette","year":"1966","unstructured":"D. Barnette. Trees in polyhedral graphs. Canadian Journal of Mathematics, 18:731\u2013736, 1966.","journal-title":"Canadian Journal of Mathematics"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"P. Bose and P. Morin. Online routing in triangulations. In Proc. 10th Annu. Internat. Sympos. Algorithms Comput., volume 1741 of Lecture Notes Comput. Sci., pages 113\u2013122. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-46632-0_12"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"G. Das, P. Heffernan, and G. Narasimhan. Optimally sparse spanners in 3-dimensional Euclidean space. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 53\u201362, 1993.","DOI":"10.1145\/160985.160998"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Das and D. Joseph. Which triangulations approximate the complete graph? In Proc. International Symposium on Optimal Algorithms, volume 401 of Lecture Notes Comput. Sci., pages 168\u2013192. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-51859-2_15"},{"key":"24_CR5","unstructured":"G. Das, G. Narasimhan, and J. Salowe. A new way to weigh malnourished Euclidean graphs. In Proc. 6th ACM-SIAM Sympos. Discrete Algorithms, pages 215\u2013222, 1995."},{"key":"24_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, Germany, 2nd edition, 2000.","edition":"2nd edition"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41\u201351, 1990.","journal-title":"Combinatorica"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"D. P. Dobkin","year":"1990","unstructured":"D. P. Dobkin, S. J. Friedman, and K. J. Supowit. Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom., 5:399\u2013407, 1990.","journal-title":"Discrete Comput. Geom."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/B978-044482537-7\/50010-3","volume-title":"Handbook of Computational Geometry","author":"D. Eppstein","year":"2000","unstructured":"D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425\u2013461. Elsevier Science Publishers, Amsterdam, 2000."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Improved greedy algorithms for constructing sparse geometric sp anners. In Proc. 7th Scand. Workshop Algorithm Theory, volume 1851 of Lecture Notes Comput. Sci., pages 314\u2013327, Berlin, 2000. Springer-Verlag.","DOI":"10.1007\/3-540-44985-X_28"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean gr aph. Discrete Comput. Geom., pages 13\u201328, 1992.","DOI":"10.1007\/BF02187821"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01758846","volume":"8","author":"C. Levcopoulos","year":"1992","unstructured":"C. Levcopoulos and A. Lingas. 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":"24_CR13","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/s00453-001-0075-x","volume":"32","author":"C. Levcopoulos","year":"2002","unstructured":"C. Levcopoulos, G. Narasimhan, and M. Smid. Improved algorithms for constructing fault-tolerant spanners. Algorithmica, 32:144\u2013156, 2002.","journal-title":"Algorithmica"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/B978-044482537-7\/50021-8","volume-title":"Handbook of Computational Geometry","author":"M. Smid","year":"2000","unstructured":"M. Smid. Closest point problems in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 877\u2013935. Elsevier Science Publishers, Amsterdam, 2000."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T03:06:38Z","timestamp":1556593598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}