{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:00:46Z","timestamp":1742925646228,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877783"},{"type":"electronic","value":"9783540877790"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87779-0_25","type":"book-chapter","created":{"date-parts":[[2008,9,22]],"date-time":"2008-09-22T05:17:14Z","timestamp":1222060634000},"page":"365-378","source":"Crossref","is-referenced-by-count":9,"title":["Computing Lightweight Spanners Locally"],"prefix":"10.1007","author":[{"given":"Iyad A.","family":"Kanj","sequence":"first","affiliation":[]},{"given":"Ljubomir","family":"Perkovi\u0107","sequence":"additional","affiliation":[]},{"given":"Ge","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_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"},{"issue":"3-4","key":"25_CR2","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":"25_CR3","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":"25_CR4","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":"25_CR5","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)","DOI":"10.1145\/160985.160998"},{"key":"25_CR6","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)","DOI":"10.1145\/177424.177579"},{"key":"25_CR7","unstructured":"Das, G., Narasimhan, G., Salowe, J.: A new way to weigh malnourished euclidean graphs. In: Proceedings of SODA, pp. 215\u2013222 (1995)"},{"issue":"5","key":"25_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."},{"key":"25_CR9","unstructured":"Kanj, I., Perkovi\u0107, L.: On geometric spanners of euclidean and unit disk graphs. In: Proceedings of STACS (2008)"},{"key":"25_CR10","unstructured":"Kanj, I., Perkovic, L., Xia, G.: Computing lightweight spanning subgraphs locally. Technical report # 08-002, \n                      http:\/\/www.cdm.depaul.edu\/research\/Pages\/TechnicalReports.aspx"},{"key":"25_CR11","unstructured":"Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proceeding of CCCG, vol.\u00a011, pp. 51\u201354 (2005)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: Proceedings of PODC, pp. 300\u2013309 (2004)","DOI":"10.1145\/1011767.1011811"},{"issue":"3","key":"25_CR13","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":"25_CR14","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 Distributed Systems.\u00a014(10), 1035\u20131047 (2003)","journal-title":"IEEE Trans. on Parallel and Distributed Systems."},{"issue":"1","key":"25_CR15","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."},{"key":"25_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"},{"issue":"2","key":"25_CR17","first-page":"161","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. MONET\u00a011(2), 161\u2013175 (2006)","journal-title":"MONET"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Wattenhofer, R.: Sensor networks: distributed algorithms reloaded - or revolutions? In: Proceedings of SIROCCO, pp. 24\u201328 (2006)","DOI":"10.1007\/11780823_3"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87779-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T04:07:31Z","timestamp":1714795651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87779-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877783","9783540877790"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87779-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}