{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:22Z","timestamp":1725516802116},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_39","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"395-404","source":"Crossref","is-referenced-by-count":0,"title":["Geometric Spanner of Objects under L 1 Distance"],"prefix":"10.1007","author":[{"given":"Yongding","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]},{"given":"Shin-ichi","family":"Tanigawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","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"},{"key":"39_CR2","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 (STOC 1995), pp. 489\u2013498 (1995)","DOI":"10.1145\/225058.225191"},{"key":"39_CR3","unstructured":"Arya, S., Mount, D.M., Smid, M.: Dynamic Algorithms for Geometric Spanners of Small Diameter: Randomized Rolutions. Technical Report, Max-Planck-Institut f\u00fcr Informatik (1994)"},{"key":"39_CR4","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"},{"issue":"1","key":"39_CR5","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":"39_CR6","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":"39_CR7","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":"39_CR8","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":"39_CR9","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":"39_CR10","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"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Keil, J.M.: Approximating the Complete Euclidean Graph. In: Proceedings of 1st Scandinavian Workshop on Algorithm Theory, pp. 208\u2013213 (1988)","DOI":"10.1007\/3-540-19487-8_23"},{"key":"39_CR12","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":"39_CR13","unstructured":"Rupper, J., Seidel, R.: Approximating the d-dimensional Complete Euclidean Graph. In: Proceedings of 3rd Canadian Conference on Computational Geometry, pp. 207\u2013210 (1991)"},{"key":"39_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-77120-3_9","volume-title":"Algorithms and Computation","author":"Y. Yang","year":"2007","unstructured":"Yang, Y., Zhu, Y., Xu, J., Katoh, N.: Geometric Spanner of Segments. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 75\u201387. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:02:18Z","timestamp":1605762138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}