{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:57Z","timestamp":1725490257665},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642317699"},{"type":"electronic","value":"9783642317705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31770-5_20","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T05:03:12Z","timestamp":1343278992000},"page":"223-233","source":"Crossref","is-referenced-by-count":1,"title":["On Certain Geometric Properties of the Yao-Yao Graphs"],"prefix":"10.1007","author":[{"given":"Iyad A.","family":"Kanj","sequence":"first","affiliation":[]},{"given":"Ge","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_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., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete & Computational Geometry\u00a09, 81\u2013100 (1993)","journal-title":"Discrete & Computational Geometry"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-642-17514-5_38","volume-title":"Algorithms and Computation","author":"P. Bose","year":"2010","unstructured":"Bose, P., Damian, M., Dou\u00efeb, K., O\u2019Rourke, J., Seamone, B., Smid, M., Wuhrer, S.: \u03c0\/2-Angle Yao Graphs Are Spanners. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol.\u00a06507, pp. 446\u2013457. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Bose, P., Damian, M., Dou\u00efeb, K., O\u2019Rourke, J., Seamone, B., Smid, M., Wuhrer, S.: \u03c0\/2-angle Yao graphs are spanners. CoRR, abs\/1001.2913 (2010)","key":"20_CR3","DOI":"10.1007\/978-3-642-17514-5_38"},{"issue":"3-4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00453-005-1168-8","volume":"42","author":"P. Bose","year":"2005","unstructured":"Bose, P., Gudmundsson, J., Smid, M.: Constructing plane spanners of bounded degree and low weight. Algorithmica\u00a042(3-4), 249\u2013264 (2005)","journal-title":"Algorithmica"},{"issue":"6","key":"20_CR5","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P. Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks\u00a07(6), 609\u2013616 (2001)","journal-title":"Wireless Networks"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-17461-2_15","volume-title":"Combinatorial Optimization and Applications","author":"M. Damian","year":"2010","unstructured":"Damian, M., Raudonis, K.: Yao Graphs Span Theta Graphs. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol.\u00a06509, pp. 181\u2013194. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Das, G., Heffernan, P., Narasimhan, G.: Optimally sparse spanners in 3-dimensional Euclidean space. In: Proceedings of the 19th ACM Symposium on Computational Geometry, pp. 53\u201362 (1993)","key":"20_CR7","DOI":"10.1145\/160985.160998"},{"doi-asserted-by":"crossref","unstructured":"Das, G., Narasimhan, G.: A fast algorithm for constructing sparse Euclidean spanners. In: Proceedings of the 20th ACM Symposium on Computational Geometry, pp. 132\u2013139 (1994)","key":"20_CR8","DOI":"10.1145\/177424.177579"},{"unstructured":"Das, G., Narasimhan, G., Salowe, J.: A new way to weigh malnourished Euclidean graphs. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 215\u2013222 (1995)","key":"20_CR9"},{"unstructured":"Demaine, E., Mitchell, J., O\u2019Rourke, J. (eds.): The open problems project: Problem 70, \n                  \n                    http:\/\/maven.smith.edu\/~orourke\/TOPP\/P70.html","key":"20_CR10"},{"issue":"5","key":"20_CR11","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1137\/S0097539700382947","volume":"31","author":"J. Gudmundsson","year":"2002","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Fast greedy algorithms for constructing sparse geometric spanners. SIAM Journal on Computing\u00a031(5), 1479\u20131500 (2002)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"20_CR12","doi-asserted-by":"publisher","first-page":"2132","DOI":"10.1137\/080737708","volume":"39","author":"I. Kanj","year":"2010","unstructured":"Kanj, I., Perkovi\u0107, L., Xia, G.: On spanners and lightweight spanners of geometric graphs. SIAM Journal on Computing\u00a039(6), 2132\u20132161 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"J. Keil","year":"1992","unstructured":"Keil, J., Gutwin, C.: Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry\u00a07, 13\u201328 (1992)","journal-title":"Discrete & Computational Geometry"},{"unstructured":"Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proceedings of the 11th Canadian Conference on Computational Geometry, pp. 51\u201354 (1999)","key":"20_CR14"},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01758846","volume":"8","author":"C. Levcopoulos","year":"1992","unstructured":"Levcopoulos, C., Lingas, A.: There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica\u00a08(3), 251\u2013256 (1992)","journal-title":"Algorithmica"},{"issue":"10","key":"20_CR16","doi-asserted-by":"publisher","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.: Localized delaunay triangulation with application in Ad Hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems\u00a014(10), 1035\u20131047 (2003)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"unstructured":"Molla, N.: Yao spanners for wireless ad hoc networks. M.S. Thesis, Department of Computer Science, Villanova University (December 2009)","key":"20_CR17"},{"doi-asserted-by":"crossref","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press (2007)","key":"20_CR18","DOI":"10.1017\/CBO9780511546884"},{"unstructured":"Wang, Y., Li, X.-Y.: Distributed spanner with bounded degree for wireless ad hoc networks. In: Proceedings of the 16th International Parallel and Distributed Processing Symposium (2002)","key":"20_CR19"},{"issue":"2","key":"20_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s11036-006-4469-5","volume":"11","author":"Y. Wang","year":"2006","unstructured":"Wang, Y., Li, X.-Y.: Localized construction of bounded degree and planar spanner for wireless ad hoc networks. Mobile Networks and Applications\u00a011(2), 161\u2013175 (2006)","journal-title":"Mobile Networks and Applications"},{"issue":"4","key":"20_CR21","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 Journal on Computing\u00a011(4), 721\u2013736 (1982)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31770-5_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:47:44Z","timestamp":1620128864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31770-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317699","9783642317705"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31770-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}