{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:07:45Z","timestamp":1725570465230},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175169"},{"type":"electronic","value":"9783642175176"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_29","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:13:41Z","timestamp":1291389221000},"page":"316-327","source":"Crossref","is-referenced-by-count":1,"title":["An Optimal Algorithm for Computing Angle-Constrained Spanners"],"prefix":"10.1007","author":[{"given":"Paz","family":"Carmi","sequence":"first","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I. Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer, I., Das, G., Dobkin, D.P., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete & Computational Geometry\u00a09, 81\u2013100 (1993)","journal-title":"Discrete & Computational Geometry"},{"key":"29_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: STOC, pp. 489\u2013498 (1995)","DOI":"10.1145\/225058.225191"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02523237","volume":"17","author":"S. Arya","year":"1997","unstructured":"Arya, S., Smid, M.: Efficient construction of a bounded-degree spanner with low weight. Algorithmica\u00a017, 33\u201354 (1997)","journal-title":"Algorithmica"},{"key":"29_CR4","unstructured":"Bose, P., Carmi, P., Farshi, M., Maheshwari, A., Smid, M.: Computing the greedy spanner in near-quadratic time. Algorithmica (to appear)"},{"key":"29_CR5","unstructured":"Callahan, P.B., Kosaraju, S.R.: Faster algorithms for some geometric graph problems in higher dimensions. In: SODA, pp. 291\u2013300 (1993)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P.B. Callahan","year":"1995","unstructured":"Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM\u00a042, 67\u201390 (1995)","journal-title":"Journal of the ACM"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0166-218X(00)00280-8","volume":"110","author":"D.Z. Chen","year":"2001","unstructured":"Chen, D.Z., Das, G., Smid, M.: Lower bounds for computing geometric spanners and approximate shortest paths. Discrete Applied Mathematics\u00a0110, 151\u2013167 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: Approximation algorithms for shortest path motion planning. In: STOC, pp. 56\u201365 (1987)","DOI":"10.1145\/28395.28402"},{"key":"29_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":"Eppstein, D.: Spanning trees and spanners. In: Handbook of Computational Geometry, pp. 425\u2013461. Elsevier Science, Amsterdam (2000)"},{"key":"29_CR10","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 & Computational Geometry\u00a07, 13\u201328 (1992)","journal-title":"Discrete & Computational Geometry"},{"key":"29_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511754722","volume-title":"Wireless Ad Hoc and Sensor Networks","author":"X.-Y. Li","year":"2008","unstructured":"Li, X.-Y.: Wireless Ad Hoc and Sensor Networks. Cambridge University Press, Cambridge (2008)"},{"key":"29_CR12","unstructured":"Lukovszki, T.: New Results on Geometric Spanners and Their Applications. Ph.D. thesis, University of Paderborn, Germany (1999)"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01840386","volume":"5","author":"K. Mehlhorn","year":"1990","unstructured":"Mehlhorn, K., N\u00e4her, S.: Dynamic fractional cascading. Algorithmica\u00a05, 215\u2013241 (1990)","journal-title":"Algorithmica"},{"key":"29_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G. Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0166-218X(94)90133-3","volume":"54","author":"J.S. Salowe","year":"1994","unstructured":"Salowe, J.S.: Euclidean spanner graphs with degree four. Discrete Applied Mathematics\u00a054, 55\u201366 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF02574005","volume":"11","author":"J. Soares","year":"1994","unstructured":"Soares, J.: Approximating Euclidean distances by small degree graphs. Discrete & Computational Geometry\u00a011, 213\u2013233 (1994)","journal-title":"Discrete & Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T13:16:13Z","timestamp":1553260573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}