{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:47:36Z","timestamp":1725497256186},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77120-3_9","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T06:31:09Z","timestamp":1196922669000},"page":"75-87","source":"Crossref","is-referenced-by-count":1,"title":["Geometric Spanner of Segments"],"prefix":"10.1007","author":[{"given":"Yang","family":"Yang","sequence":"first","affiliation":[]},{"given":"Yongding","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Keil, J.M.: Approximating the complete euclidean graph. In: 1st Scandinavian Workshop on Algorithm Theory, pp. 208\u2013213 (1988)","DOI":"10.1007\/3-540-19487-8_23"},{"key":"9_CR2","doi-asserted-by":"publisher","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 and Computational Geometry\u00a07, 13\u201328 (1992)","journal-title":"Discrete and Computational Geometry"},{"key":"9_CR3","unstructured":"Rupper, J., Seidel, R.: Approximating the d-dimensional complete euclidean graph. In: 3rd Canadian Conference on Computational Geometry, pp. 207\u2013210 (1991)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: Approximation algorithms for shortest path motion planning. In: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 56\u201365 (1987)","DOI":"10.1145\/28395.28402"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Arya, S., Das, G., Mount, D.M., Salowe, J.S., Smid, M.: Euclidean spanners: short, thin, and lanky. In: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, pp. 489\u2013498 (1995)","DOI":"10.1145\/225058.225191"},{"key":"9_CR6","unstructured":"Arya, S., Mount, D.M., Smid, M.: Dynamic algorithms for geometric spanners of small diameter: randomized solutions. Technical report, Max-Planck-Institut f\u00fcr Informatik (1994)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Arya, S., Mount, D.M., Smid, M.: Randomized and deterministic algorithms for geometric spanners of small diameter. In: 35th IEEE Symposium on Foundtions of Computer Science, pp. 703\u2013712 (1994)","DOI":"10.1109\/SFCS.1994.365722"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Chandra, B., Das, G., Narasimhan, G., Soares, J.: New spareness results on graph spanners. In: Proceedings of the eighth annual symposium on Computational geometry, pp. 192\u2013201 (1992)","DOI":"10.1145\/142675.142717"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Das, G., Heffernan, P., Narasimhan, G.: Optimally sparse spanners in 3-dimensional euclidean space. In: Proceedings of the ninth annual symposium on Computational geometry, pp. 53\u201362 (1993)","DOI":"10.1145\/160985.160998"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Das, G., Narasimhan, G.: A fast algorithm for constructing sparse euclidean spanners. In: Proceedings of the tenth annual symposium on Computational geometry, pp. 132\u2013139 (1994)","DOI":"10.1145\/177424.177579"},{"issue":"5","key":"9_CR11","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 - Journal on Computing\u00a031(5), 1479\u20131500 (2002)","journal-title":"SIAM - Journal on Computing"},{"issue":"1","key":"9_CR12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.comgeo.2004.09.001","volume":"30","author":"T. Asano","year":"2005","unstructured":"Asano, T., de Berg, M., Cheong, O., Everett, H., Haverkort, H., Katoh, N., Wolff, A.: Optimal spanners for axis-aligned rectangles. Comput. Geom. Theory Appl.\u00a030(1), 59\u201377 (2005)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Aronov, B., de Berg, M., Cheong, O., Gudmundsson, J., Haverkort, H., Smid, M., Vigneron, A.: Sparse geometric graphs with small dilation. In: Proceedings of the 12th Computing: The Australasian Theroy Symposium, vol.\u00a051 (2006)","DOI":"10.1007\/11602613_7"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:01:31Z","timestamp":1619506891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771180"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_9","relation":{},"subject":[]}}