{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:46:59Z","timestamp":1725756419620},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450426"},{"type":"electronic","value":"9783642450433"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45043-3_10","type":"book-chapter","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T09:05:50Z","timestamp":1384247150000},"page":"100-114","source":"Crossref","is-referenced-by-count":2,"title":["The \u03b8 5-Graph is a Spanner"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"van Renssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sander","family":"Verdonschot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press (2007)","key":"10_CR1","DOI":"10.1017\/CBO9780511546884"},{"doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Approximation algorithms for shortest path motion planning. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC 1987), pp. 56\u201365 (1987)","key":"10_CR2","DOI":"10.1145\/28395.28402"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-19487-8_23","volume-title":"SWAT \u201988","author":"J. Keil","year":"1988","unstructured":"Keil, J.: Approximating the complete Euclidean graph. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol.\u00a0318, pp. 208\u2013213. Springer, Heidelberg (1988)"},{"unstructured":"Ruppert, J., Seidel, R.: Approximating the d-dimensional complete Euclidean graph. In: Proceedings of the 3rd Canadian Conference on Computational Geometry (CCCG 1991), pp. 207\u2013210 (1991)","key":"10_CR4"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-16926-7_25","volume-title":"Graph Theoretic Concepts in Computer Science","author":"N. Bonichon","year":"2010","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Ilcinkas, D.: Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 266\u2013278. Springer, Heidelberg (2010)"},{"unstructured":"El Molla, N.M.: Yao spanners for wireless ad hoc networks. Master\u2019s thesis, Villanova University (2009)","key":"10_CR6"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-40104-6_10","volume-title":"Algorithms and Data Structures","author":"L. Barba","year":"2013","unstructured":"Barba, L., Bose, P., De Carufel, J.-L., van Renssen, A., Verdonschot, S.: On the stretch factor of the theta-4 graph. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol.\u00a08037, pp. 109\u2013120. Springer, Heidelberg (2013)"},{"unstructured":"Rysavy, P.: Wireless broadband and other fixed-wireless systems, \n                  \n                    http:\/\/www.networkcomputing.com\/netdesign\/bb1.html\n                  \n                  \n                 (accessed December 3, 2012)","key":"10_CR8"},{"unstructured":"SATEL Oy. What is a radio modem?, \n                  \n                    http:\/\/www.satel.com\/products\/what-is-a-radio-modem\n                  \n                  \n                 (accessed December 3, 2012)","key":"10_CR9"},{"doi-asserted-by":"crossref","unstructured":"Morin, P., Verdonschot, S.: On the average number of edges in theta graphs. CoRR, abs\/1304.3402 (2013)","key":"10_CR10","DOI":"10.1137\/1.9781611973204.12"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45043-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T02:18:22Z","timestamp":1558664302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45043-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450426","9783642450433"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45043-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}