{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,22]],"date-time":"2023-04-22T01:58:20Z","timestamp":1682128700414},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,18]],"date-time":"2012-11-18T00:00:00Z","timestamp":1353196800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s10878-012-9570-z","type":"journal-article","created":{"date-parts":[[2012,11,17]],"date-time":"2012-11-17T08:38:28Z","timestamp":1353141508000},"page":"78-87","source":"Crossref","is-referenced-by-count":1,"title":["On certain geometric properties of the Yao\u2013Yao graphs"],"prefix":"10.1007","volume":"27","author":[{"given":"Iyad A.","family":"Kanj","sequence":"first","affiliation":[]},{"given":"Ge","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,18]]},"reference":[{"key":"9570_CR1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer I, Das G, Dobkin D, Joseph D, Soares J (1993) On sparse spanners of weighted graphs. Discret. Comput. Geom. 9:81\u2013100","journal-title":"Discret. Comput. Geom."},{"key":"9570_CR2","unstructured":"Bauer M, Damian M (2012) An infinite class of sparse-yao spanners. CoRR, abs\/1206.3628"},{"key":"9570_CR3","unstructured":"Bose P, Damian M, Dou\u00efeb K, O\u2019Rourke J, Seamone B, Smid M, Wuhrer S (2010) $$\\pi \/2$$ -angle Yao graphs are spanners. In 21st international symposium on algorithms and computation, vol 6507 of Lecture Notes in Computer Science. Springer, pp 446\u2013457"},{"key":"9570_CR4","unstructured":"Bose P, Damian M, Dou\u00efeb K, O\u2019Rourke J, Seamone B, Smid M, Wuhrer S (2010) $$\\pi \/2$$ -angle Yao graphs are spanners. CoRR, abs\/1001.2913"},{"issue":"3\u20134","key":"9570_CR5","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s00453-005-1168-8","volume":"42","author":"P Bose","year":"2005","unstructured":"Bose P, Gudmundsson J, Smid M (2005) Constructing plane spanners of bounded degree and low weight. Algorithmica 42(3\u20134):249\u2013264","journal-title":"Algorithmica"},{"issue":"6","key":"9570_CR6","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P Bose","year":"2001","unstructured":"Bose P, Morin P, Stojmenovic I, Urrutia J (2001) Routing with guaranteed delivery in ad hoc wireless networks. Wirel NetW 7(6):609\u2013616","journal-title":"Wirel NetW"},{"key":"9570_CR7","unstructured":"Damian M, Molla N, Pinciu V (2009) Spanner properties of $$\\pi \/2$$ -angle yao graphs. In Proceedings of the 25th European Workshop on, Computational Geometry, pp 21\u201324"},{"key":"9570_CR8","doi-asserted-by":"crossref","unstructured":"Damian M, Raudonis K (2010) Yao graphs span theta graphs. In Proceedings of the 4th international conference on Combinatorial optimization and applications\u2014vol Part II, COCOA\u201910. Springer, Berlin, pp 181\u2013194","DOI":"10.1007\/978-3-642-17461-2_15"},{"key":"9570_CR9","doi-asserted-by":"crossref","unstructured":"Das G, Heffernan P, Narasimhan G (1993) Optimally sparse spanners in 3-dimensional Euclidean space. In proceedings of the 19th ACM symposium on, computational geometry, pp 53\u201362","DOI":"10.1145\/160985.160998"},{"key":"9570_CR10","doi-asserted-by":"crossref","unstructured":"Das G, Narasimhan G (1994) A fast algorithm for constructing sparse Euclidean spanners. In proceedings of the 20th ACM symposium on, computational geometry, pp 132\u2013139","DOI":"10.1145\/177424.177579"},{"key":"9570_CR11","unstructured":"Das G, Narasimhan G, Salowe J (1995) A new way to weigh malnourished Euclidean graphs. In proceedings of the sixth annual ACM-SIAM symposium on discrete algorithms, pp 215\u2013222"},{"key":"9570_CR12","unstructured":"Demaine E, Mitchell J, O\u2019Rourke J (eds.) (2008) The open problems project: Problem 70. Available at: http:\/\/maven.smith.edu\/~orourke\/TOPP\/P70.html"},{"issue":"5","key":"9570_CR13","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1137\/S0097539700382947","volume":"31","author":"J Gudmundsson","year":"2002","unstructured":"Gudmundsson J, Levcopoulos C, Narasimhan G (2002) Fast greedy algorithms for constructing sparse geometric spanners. SIAM J Comput 31(5):1479\u20131500","journal-title":"SIAM J Comput"},{"issue":"6","key":"9570_CR14","doi-asserted-by":"crossref","first-page":"2132","DOI":"10.1137\/080737708","volume":"39","author":"I Kanj","year":"2010","unstructured":"Kanj I, Perkovi\u0107 L, Xia G (2010) On spanners and lightweight spanners of geometric graphs. SIAM J Comput 39(6):2132\u20132161","journal-title":"SIAM J Comput"},{"key":"9570_CR15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"J Keil","year":"1992","unstructured":"Keil J, Gutwin C (1992) Classes of graphs which approximate the complete Euclidean graph. Discret Comput Geom 7:13\u201328","journal-title":"Discret Comput Geom"},{"key":"9570_CR16","unstructured":"Kranakis E, Singh H, Urrutia J (1999) Compass routing on geometric networks. In proceedings of the 11th Canadian Conference on, Computational Geometry, pp 51\u201354"},{"issue":"3","key":"9570_CR17","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01758846","volume":"8","author":"C Levcopoulos","year":"1992","unstructured":"Levcopoulos C, Lingas A (1992) There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica 8(3):251\u2013256","journal-title":"Algorithmica"},{"issue":"10","key":"9570_CR18","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1109\/TPDS.2003.1239871","volume":"14","author":"X-Y Li","year":"2003","unstructured":"Li X-Y, Calinescu G, Wan P-J, Wang Y (2003) Localized delaunay triangulation with application in Ad Hoc wireless networks. IEEE Trans Parallel Distrib Syst 14(10):1035\u20131047","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"9570_CR19","unstructured":"Molla N (2009) Yao spanners for wireless ad hoc networks. M.S. Thesis, Department of Computer Science, Villanova University, Dec 2009"},{"key":"9570_CR20","doi-asserted-by":"crossref","unstructured":"Narasimhan G, Smid M (2007) Geometric Spanner Networks. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511546884"},{"key":"9570_CR21","unstructured":"Wang Y, Li X-Y (2002) Distributed spanner with bounded degree for wireless ad hoc networks. In proceedings of the 16th international parallel and distributed processing symposium"},{"issue":"2","key":"9570_CR22","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s11036-006-4469-5","volume":"11","author":"Y Wang","year":"2006","unstructured":"Wang Y, Li X-Y (2006) Localized construction of bounded degree and planar spanner for wireless ad hoc networks. Mobile NetW Appl 11(2):161\u2013175","journal-title":"Mobile NetW Appl"},{"issue":"4","key":"9570_CR23","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"AC-C Yao","year":"1982","unstructured":"Yao AC-C (1982) On constructing minimum spanning trees in $$k$$ -dimensional spaces and related problems. SIAM J Comput 11(4):721\u2013736","journal-title":"SIAM J Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9570-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9570-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9570-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T14:56:27Z","timestamp":1562338587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9570-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,18]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9570"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9570-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,18]]}}}