{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:32:04Z","timestamp":1725532324170},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020162"},{"type":"electronic","value":"9783642020179"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02017-9_8","type":"book-chapter","created":{"date-parts":[[2009,5,11]],"date-time":"2009-05-11T15:38:06Z","timestamp":1242056286000},"page":"49-58","source":"Crossref","is-referenced-by-count":0,"title":["On Spanners of Geometric Graphs"],"prefix":"10.1007","author":[{"given":"Iyad A.","family":"Kanj","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"8_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":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-45749-6_24","volume-title":"Algorithms - ESA 2002","author":"P. Bose","year":"2002","unstructured":"Bose, P., Gudmundsson, J., Smid, M.: Constructing plane spanners of bounded degree and low weight. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 234\u2013246. Springer, Heidelberg (2002)"},{"issue":"3-4","key":"8_CR3","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":"4","key":"8_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."},{"issue":"6","key":"8_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":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/11940128_19","volume-title":"Algorithms and Computation","author":"P. Bose","year":"2006","unstructured":"Bose, P., Smid, M., Xu, D.: Diamond triangulations contain spanners of bounded degree. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 173\u2013182. Springer, Heidelberg (2006)"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"P. Chew","year":"1989","unstructured":"Chew, P.: There are planar graphs almost as good as the complete graph. Journal of Computers and System Sciences\u00a039(2), 205\u2013219 (1989)","journal-title":"Journal of Computers and System Sciences"},{"doi-asserted-by":"crossref","unstructured":"Das, G., Heffernan, P., Narasimhan, G.: Optimally sparse spanners in 3-dimensional euclidean space. In: Proceedings of SoCG, pp. 53\u201362 (1993)","key":"8_CR8","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 SoCG, pp. 132\u2013139 (1994)","key":"8_CR9","DOI":"10.1145\/177424.177579"},{"key":"8_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF02187801","volume":"5","author":"D. Dobkin","year":"1990","unstructured":"Dobkin, D., Friedman, S., Supowit, K.: Delaunay graphs are almost as good as complete graphs. Discrete Computational Geometry\u00a05(4), 399\u2013407 (1990)","journal-title":"Discrete Computational Geometry"},{"issue":"5","key":"8_CR12","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 J. Comput.\u00a031(5), 1479\u20131500 (2002)","journal-title":"SIAM J. Comput."},{"unstructured":"Kanj, I., Perkovi\u0107, L.: On geometric spanners of euclidean and unit disk graphs. In: Proceedings of STACS (2008)","key":"8_CR13"},{"key":"8_CR14","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: Proceeding of CCCG, pp. 51\u201354 (1999)","key":"8_CR15"},{"issue":"3","key":"8_CR16","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":"8_CR17","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 Trans. on Parallel and Dist. Systems.\u00a014(10), 1035\u20131047 (2003)","journal-title":"IEEE Trans. on Parallel and Dist. Systems."},{"key":"8_CR18","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, Cambridge (2007)"},{"issue":"2","key":"8_CR19","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":"8_CR20","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","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02017-9_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T10:17:39Z","timestamp":1619777859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02017-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020162","9783642020179"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02017-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}