{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:29:52Z","timestamp":1742912992164,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":17,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781493928637"},{"type":"electronic","value":"9781493928644"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_103","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:12Z","timestamp":1461268992000},"page":"512-516","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Degree-Bounded Planar Spanner with Low Weight"],"prefix":"10.1007","author":[{"given":"Wen-Zhan","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang-Yang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weizhao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"98_CR4107","doi-asserted-by":"crossref","unstructured":"Bose P, Gudmundsson J, Smid M (2002) Constructing plane spanners of bounded degree and low weight. In: Proceedings of European symposium of algorithms, University of Rome, 17\u201321 Sept 2002","DOI":"10.1007\/3-540-45749-6_24"},{"issue":"6","key":"98_CR4108","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 (2001) Routing with guaranteed delivery in ad hoc wireless networks. ACM\/Kluwer Wirel Netw 7(6):609\u2013616, 3rd international workshop on discrete algorithms and methods for mobile computing and communications, pp 48\u201355 (1999)","journal-title":"ACM\/Kluwer Wirel Netw"},{"key":"98_CR4109","doi-asserted-by":"crossref","unstructured":"Burkhart M, von Rickenbach P, Wattenhofer R, Zollinger A (2004) Does topology control reduce interference. In: ACM international symposium on mobile Ad-Hoc networking and computing (Mobi-Hoc), Tokyo, 24\u201326 May 2004","DOI":"10.1145\/989459.989462"},{"key":"98_CR4110","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"KR Gabriel","year":"1969","unstructured":"Gabriel KR, Sokal RR (1969) A new statistical approach to geographic variation analysis. Syst Zool 18:259\u2013278","journal-title":"Syst Zool"},{"key":"98_CR4111","doi-asserted-by":"crossref","unstructured":"Karp B, Kung HT (2000) Gpsr: greedy perimeter stateless routing for wireless networks. In: Proceedings of the ACM\/IEEE international conference on mobile computing and networking (MobiCom), Boston, 6\u201311 Aug 2000","DOI":"10.1145\/345910.345953"},{"key":"98_CR4112","unstructured":"Kleinrock L, Silvester J (1978) Optimum transmission radii for packet radio networks or why six is a magic number. In: Proceedings of the IEEE national telecommunications conference, Birmingham, pp 431\u2013435, 4\u20136 Dec 1978"},{"key":"98_CR4113","doi-asserted-by":"crossref","unstructured":"Kuhn F, Wattenhofer R, Zollinger A (2002) Asymptotically optimal geometric mobile ad-hoc routing. In: International workshop on discrete algorithms and methods for mobile computing and communications (DIALM), Atlanta, 28 Sept 2002","DOI":"10.1145\/570810.570814"},{"key":"98_CR4114","doi-asserted-by":"crossref","unstructured":"Kuhn F, Wattenhofer R, Zollinger A (2003) Worst-case optimal and average-case efficient geometric ad-hoc routing. In: ACM international symposium on mobile Ad-Hoc networking and computing (MobiHoc), Anapolis, 1\u20133 June 2003","DOI":"10.1145\/778415.778447"},{"key":"98_CR4115","doi-asserted-by":"crossref","unstructured":"Li L, Halpern JY, Bahl P, Wang Y-M, Wattenhofer R (2001) Analysis of a cone-based distributed topology control algorithms for wireless multi-hop networks. In: PODC: ACM symposium on principle of distributed computing, Newport, 26\u201329 Aug 2001","DOI":"10.1145\/383962.384043"},{"key":"98_CR4116","doi-asserted-by":"crossref","unstructured":"Li X-Y (2003) Approximate MST for UDG locally. In: COCOON, Big Sky, 25\u201328 July 2003","DOI":"10.1007\/3-540-45071-8_37"},{"key":"98_CR4117","unstructured":"Li X-Y, Wan P-J, Wang Y, Frieder O (2002) Sparse power efficient topology for wireless networks. In: IEEE Hawaii international conference on system sciences (HICSS), Big Island, 7\u201310 Jan 2002"},{"key":"98_CR4118","unstructured":"Li X-Y, Wang Y, Song W-Z, Wan P-J, Frieder O (2004) Localized minimum spanning tree and its applications in wireless ad hoc networks. In: IEEE INFOCOM, Hong Kong, 7\u201311 Mar 2004"},{"key":"98_CR4119","doi-asserted-by":"crossref","unstructured":"Song W-Z, Wang Y, Li X-Y, Frieder O (2004) Localized algorithms for energy efficient topology in wireless ad hoc networks. In: ACM international symposium on mobile Ad-Hoc networking and computing (MobiHoc), Tokyo, 24\u201326 May 2004","DOI":"10.1145\/989459.989473"},{"issue":"4","key":"98_CR4120","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"GT Toussaint","year":"1980","unstructured":"Toussaint GT (1980) The relative neighborhood graph of a finite planar set. Pattern Recognit 12(4):261\u2013268","journal-title":"Pattern Recognit"},{"key":"98_CR4121","doi-asserted-by":"crossref","unstructured":"Wan P-J, Calinescu G, Li X-Y, Frieder O (2001) Minimum-energy broadcast routing in static ad hoc wireless networks. ACM wireless networks (2002), To appear, Preliminary version appeared in IEEE INFOCOM, Anchorage, 22\u201326 Apr 2001","DOI":"10.1109\/INFCOM.2001.916310"},{"key":"98_CR4122","unstructured":"Wang Y, Li X-Y (2003) Efficient construction of bounded degree and planar spanner for wireless networks. In: ACM DIALMPOMC joint workshop on foundations of mobile computing, San Diego, 19 Sept 2003"},{"key":"98_CR4123","doi-asserted-by":"publisher","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:721\u2013736","journal-title":"SIAM J Comput"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:58:15Z","timestamp":1553097495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4939-2864-4_103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_103","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}