{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:13:04Z","timestamp":1742991184035,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020841"},{"type":"electronic","value":"9783642020858"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02085-8_23","type":"book-chapter","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T05:13:28Z","timestamp":1243919608000},"page":"315-328","source":"Crossref","is-referenced-by-count":1,"title":["Local Construction of Spanners in the 3-D Space"],"prefix":"10.1007","author":[{"given":"Iyad A.","family":"Kanj","sequence":"first","affiliation":[]},{"given":"Ge","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Fenghui","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_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":"23_CR2","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Fraigniaud, P., Narayanan, L.: Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges. In: DIALM, pp. 19\u201327 (2001)","DOI":"10.1145\/381448.381451"},{"issue":"3-4","key":"23_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":"2","key":"23_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1006\/jagm.1996.0806","volume":"23","author":"G. Brinkmann","year":"1997","unstructured":"Brinkmann, G., Dress, A.W.M.: A constructive enumeration of fullerenes. J. Algorithms\u00a023(2), 345\u2013358 (1997)","journal-title":"J. Algorithms"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Chen, J., Jiang, A., Kanj, I., Xia, G., Zhang, F.: Separability and topology control of quasi unit disk graphs. In: Proceedings of INFOCOM, pp. 2225\u20132233 (2007)","DOI":"10.1109\/INFCOM.2007.257"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Damian, M., Pandit, S., Pemmaraju, S.: Local approximation schemes for topology control. In: Proceedings of PODC, pp. 208\u2013217 (2006)","DOI":"10.1145\/1146381.1146413"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Das, G., Heffernan, P., Narasimhan, G.: Optimally sparse spanners in 3-D Euclidean space. In: Proceedings of SoCG, pp. 53\u201362 (1993)","DOI":"10.1145\/160985.160998"},{"issue":"5","key":"23_CR8","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."},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00454-005-1215-x","volume":"36","author":"T.C. Hales","year":"2006","unstructured":"Hales, T.C.: Sphere packings, vi. tame graphs and linear programs. Discrete & Computational Geometry\u00a036(1), 205\u2013265 (2006)","journal-title":"Discrete & Computational Geometry"},{"key":"23_CR10","unstructured":"Kanj, I., Wiese, A., Zhang, F.: Computing the k-hop neighborhoods locally. Technique report #08-007, http:\/\/www.cdm.depaul.edu\/research\/Pages\/TechnicalReports.aspx"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Kroto, H.W., Heath, J.R., O\u2019Brien, S.C., Curl, R.F., Smalley, R.E.: C60:\u00a0buckminsterfullerene. Nature\u00a0318, 162\u2013163","DOI":"10.1038\/318162a0"},{"issue":"3","key":"23_CR12","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"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Li, X.-Y., Song, W.-Z., Wang, W.: A unified energy-efficient topology for unicast and broadcast. In: MOBICOM, pp. 1\u201315 (2005)","DOI":"10.1145\/1080829.1080831"},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput.\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"23_CR15","first-page":"423","volume":"2","author":"J. Malkevitch","year":"1994","unstructured":"Malkevitch, J.: A note on fullerenes. Fullerenes, Nanotubes and Carbon Nanostructures\u00a02(4), 423\u2013426 (1994)","journal-title":"Fullerenes, Nanotubes and Carbon Nanostructures"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematis and Applications (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Wiese, A., Kranakis, E.: Local construction and coloring of spanners of location aware unit disk graphs. In: WG, pp. 372\u2013383 (2008)","DOI":"10.1007\/978-3-540-92248-3_33"},{"issue":"4","key":"23_CR18","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","Distributed Computing in Sensor Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02085-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:55:56Z","timestamp":1558349756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02085-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020841","9783642020858"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02085-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}