{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:46Z","timestamp":1725489826237},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73951-7_27","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T10:18:03Z","timestamp":1187605083000},"page":"300-311","source":"Crossref","is-referenced-by-count":4,"title":["On a Family of Strong Geometric Spanners That Admit Local Routing Strategies"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Paz","family":"Carmi","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Couture","sequence":"additional","affiliation":[]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[]},{"given":"Daming","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Bose, P., Carmi, P., Couture, M., Smid, M., Xu, D.: On a family of strong geometric spanners that admit local routing strategies. Technical Report TR-07-08, School of Computer Science, Carleton University (2007)"},{"issue":"2","key":"27_CR2","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1137\/S0895480197318088","volume":"20","author":"P. Bose","year":"2006","unstructured":"Bose, P., Devroye, L., Evans, W., Kirkpatrick, D.: On the spanning ratio of Gabriel graphs and \u03b2-skeletons. SIAM Journal of Disc. Math.\u00a020(2), 412\u2013427 (2006)","journal-title":"SIAM Journal of Disc. Math."},{"issue":"3","key":"27_CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.comgeo.2004.04.003","volume":"29","author":"P. Bose","year":"2004","unstructured":"Bose, P., Maheshwari, A., Narasimhan, G., Smid, M., Zeh, N.: Approximating geometric bottleneck shortest paths. Comput. Geom. Theory Appl.\u00a029(3), 233\u2013249 (2004)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"27_CR4","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1137\/S0097539700369387","volume":"33","author":"P. Bose","year":"2004","unstructured":"Bose, P., Morin, P.: Online routing in triangulations. SIAM J. Comput.\u00a033(4), 937\u2013951 (2004)","journal-title":"SIAM J. Comput."},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11795490_19","volume-title":"Principles of Distributed Systems","author":"E. Chavez","year":"2006","unstructured":"Chavez, E., Dobrev, S., Kranakis, E., Opatrny, J., Stacho, L., Tejeda, H., Urrutia, J.: Half-space proximal: A new local test for extracting a bounded dilation spanner. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol.\u00a03974, Springer, Heidelberg (2006)"},{"issue":"1","key":"27_CR6","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 Comput. Geom.\u00a07(1), 13\u201328 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"27_CR7","doi-asserted-by":"crossref","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, New York (2007)"},{"issue":"4","key":"27_CR8","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A.C.-C. Yao","year":"1982","unstructured":"Yao, A.C.-C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput.\u00a011(4), 721\u2013736 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:05:54Z","timestamp":1619517954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540739487","9783540739517"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}