{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:54Z","timestamp":1740107154030,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T00:00:00Z","timestamp":1581292800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T00:00:00Z","timestamp":1581292800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1319648","CCF-1533564"],"award-info":[{"award-number":["CCF-1319648","CCF-1533564"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0430849","MRI-1229185"],"award-info":[{"award-number":["CCF-0430849","MRI-1229185"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","award":["MISU F 6001 1"],"award-info":[{"award-number":["MISU F 6001 1"]}],"id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1218814"],"award-info":[{"award-number":["CCF-1218814"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00373-020-02135-2","type":"journal-article","created":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T13:03:03Z","timestamp":1581339783000},"page":"525-538","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spanning Properties of Theta\u2013Theta-6"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8255-2639","authenticated-orcid":false,"given":"Mirela","family":"Damian","sequence":"first","affiliation":[]},{"given":"John","family":"Iacono","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Winslow","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,10]]},"reference":[{"issue":"4","key":"2135_CR1","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TPDS.2003.1195412","volume":"14","author":"K Alzoubi","year":"2003","unstructured":"Alzoubi, K., Xiang-Yang Li, Y., Wang, P.-J.W., Frieder, O.: Geometric spanners for wireless ad hoc networks. IEEE Trans. Parallel Distrib. Syst. 14(4), 408\u2013421 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"2135_CR2","first-page":"19","volume":"6","author":"L Barba","year":"2015","unstructured":"Barba, L., Bose, P., Damian, M., Fagerberg, R., Keng, W.L., O\u2019Rourke, J., van Renssen, A., Taslakian, P., Verdonschot, S., Xia, G.: New and improved spanning ratios for Yao graphs. J. Comput. Geom. 6(2), 19\u201353 (2015)","journal-title":"J. Comput. Geom."},{"key":"2135_CR3","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Ilcinkas, D.: Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces. In: Proceedings of the 36th international conference on graph-theoretic concepts in computer science, WG\u201910, pp. 266\u2013278. Berlin, Heidelberg (2010). Springer-Verlag"},{"key":"2135_CR4","unstructured":"Bose, P., Damian, M., Dou\u00efeb, K., O\u2019Rourke, J., Seamone, B., Michiel S.H.M., Wuhrer, S.: $$\\pi \/2$$-angle Yao graphs are spanners (2010). CoRR, abs\/1001.2913"},{"key":"2135_CR5","doi-asserted-by":"crossref","unstructured":"Bose, P., De\u00a0Carufel, J.L., Hill, D., Smid, M.: On the spanning and routing ratio of Theta-four. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201919, pp. 2361\u20132370 (2019)","DOI":"10.1137\/1.9781611975482.144"},{"issue":"C","key":"2135_CR6","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2015.12.017","volume":"616","author":"P Bose","year":"2016","unstructured":"Bose, P., De Carufel, J.-L., Morin, P., van Renssen, A., Verdonschot, S.: Towards tight bounds on Theta-graphs: More is not always better. Theoret. Comput. Sci. 616(C), 70\u201393 (2016)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"2135_CR7","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.comgeo.2014.08.005","volume":"48","author":"P Bose","year":"2015","unstructured":"Bose, P., Morin, P., van Renssen, A., Verdonschot, S.: The Theta-5 graph is a spanner. A preliminary version appeared in Proceedings of the 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG\u201913). Comput. Geom. Theory Appl. 48(2), 108\u2013119 (2015)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"2135_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"LP Chew","year":"1989","unstructured":"Chew, L.P.: There are planar graphs almost as good as the complete graph. J. Comput. Syst. Sci. 39(2), 205\u2013219 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"2135_CR9","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: Approximation algorithms for shortest path motion planning. In: Proceedings of the 19th Annual ACM Conference on Theory of Computing, STOC\u201987, pp. 56\u201365 (1987)","DOI":"10.1145\/28395.28402"},{"key":"2135_CR10","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.comgeo.2017.05.004","volume":"68","author":"M Damian","year":"2018","unstructured":"Damian, M.: Cone-based spanners of constant degree. Computational Geometry Theory and Applications 68, 48\u201361 (2018). Special issue in memory of Ferran Hurtado","journal-title":"Computational Geometry Theory and Applications"},{"key":"2135_CR11","unstructured":"Damian, M., Bauer, M.: An infinite class of sparse-Yao spanners. In: Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms, SODA\u201913, pp. 184\u2013196, January 6-8 (2013)"},{"key":"2135_CR12","unstructured":"Damian, M., Molla, N., Pinciu, V.: Spanner properties of $$\\pi \/2$$-angle Yao graphs. In: Proceedings of the 25th European Workshop on Computational Geometry, pp. 21\u201324 (2009)"},{"issue":"C","key":"2135_CR13","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.comgeo.2016.12.001","volume":"62","author":"M Damian","year":"2017","unstructured":"Damian, M., Nelavalli, N.: Improved bounds on the stretch factor of $${Y}_4$$. Comput. Geom. Theory Appl. 62(C), 14\u201324 (2017)","journal-title":"Comput. Geom. Theory Appl."},{"key":"2135_CR14","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: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425\u2013461. Elsevier Science, Amsterdam (2000)"},{"key":"2135_CR15","doi-asserted-by":"crossref","unstructured":"Fischer, M., Lukovszki, T., Ziegler, M.: Geometric searching in walkthrough animations with weak spanners in real time. In: ESA \u201998: Proceedings of the 6th Annual European Symposium on Algorithms, pp. 163\u2013174 (1998)","DOI":"10.1007\/3-540-68530-8_14"},{"key":"2135_CR16","unstructured":"Jin, Y., Li, J., Zhan, W.: Odd Yao-Yao graphs are not spanners. In: 34th International Symposium on Computational Geometry (SoCG\u201918), June 11\u201314, 2018, Budapest, Hungary, vol. 49, pp. 1\u201315 (2018)"},{"key":"2135_CR17","doi-asserted-by":"crossref","unstructured":"Keil, J.M.: Approximating the complete Euclidean graph. In: Proceedings of the 1st Scandinavian Workshop on Algorithm Theory, number 318 in SWAT\u201988, pp. 208\u2013213. Springer-Verlag, London, UK (1988)","DOI":"10.1007\/3-540-19487-8_23"},{"key":"2135_CR18","unstructured":"Li, J., Zhan, W.: Almost all even Yao-Yao graphs are spanners. In: 24th Annual European Symposium on Algorithms ESA\u201916, vol.\u00a062, pp. 1\u201313 (2016)"},{"key":"2135_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511754722","volume-title":"Wireless Ad Hoc and Sensor Networks: Theory and Applications","author":"X-Y Li","year":"2008","unstructured":"Li, X.-Y.: Wireless Ad Hoc and Sensor Networks: Theory and Applications. Cambridge University Press, New York, NY, USA (2008)"},{"key":"2135_CR20","unstructured":"Li, X.Y., Wan, P.J., Wang, Y., Frieder, O.: Sparse power efficient topology for wireless networks. In: HICSS\u201902: Proceedings of the 35th Annual Hawaii Int. Conference on System Sciences, vol.\u00a09, p. 296.2, (2002)"},{"key":"2135_CR21","unstructured":"Molla, N.: Yao spanners for wireless ad hoc networks. Technical report, M.S. Thesis, Department of Computer Science, Villanova University (December 2009)"},{"key":"2135_CR22","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, New York, NY, USA (2007)"},{"key":"2135_CR23","unstructured":"Ruppert, J., Seidel, R.: Approximating the $$d$$-dimensional complete Euclidean graph. In: Proceedings of the 3rd Canadian Conference on Computational Geometry, CCCG\u201991, pp. 207\u2013210 (1991)"},{"issue":"4","key":"2135_CR24","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"AC-C Yao","year":"1982","unstructured":"Yao, A.C.-C.: On constructing minimum spanning trees in $$k$$-dimensional spaces and related problems. SIAM J. Comput. 11(4), 721\u2013736 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02135-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02135-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02135-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T01:05:31Z","timestamp":1612919131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02135-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,10]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["2135"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02135-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,2,10]]},"assertion":[{"value":"22 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}