{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:11:24Z","timestamp":1729627884467,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/infocom.2015.7218481","type":"proceedings-article","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T17:33:36Z","timestamp":1440437616000},"page":"1080-1085","source":"Crossref","is-referenced-by-count":0,"title":["Approximation algorithm for minimum weight fault-tolerant virtual backbone in homogeneous wireless sensor network"],"prefix":"10.1109","author":[{"given":"Zhao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishuo","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.06.022"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.08.037"},{"article-title":"Fault-tolerant coverage with maximum liftetime in wireless sensor networks","year":"0","author":"willson","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2227791"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2009.051053"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-009-9229-6"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9638-4"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-008-9384-9"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2007.4454774"},{"article-title":"Design and analysis of approximation algorithms. Springer","year":"2012","author":"du","key":"ref10"},{"article-title":"Connected Dominating Set: Theory and Applications","year":"2012","author":"du","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7997-1_42"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9690-0"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-3-642-12450-1_13","article-title":"A (4 + ?) -approximation for the minimum-weight dominating set problem in unit disk graphs","author":"erlebach","year":"2010","journal-title":"Approximation and Online Algorithms LNCS 5893"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.suscom.2011.05.005"},{"key":"ref16","first-page":"115","article-title":"A 2-spproximation for minimum cost {0, 1, 2} vertex connectivity","author":"fleischer","year":"2001","journal-title":"Proc IPCO"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1167935.1167941"},{"key":"ref18","first-page":"300","article-title":"Faster and simpler algorithms for multi-commodity flows and other fractional packing problems","author":"garg","year":"1998","journal-title":"FOCS'98"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830909000105"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019411"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","author":"bondy","year":"2008","journal-title":"Graph Theory"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.025"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-23830-1_8"},{"key":"ref6","first-page":"165","article-title":"Unit disk graphs. Annals of Discrete Mathematics","volume":"48","author":"clark","year":"1991"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2008.15"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/net.10097"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.11.015"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.12.010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2004.1311452"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1997.605303"},{"key":"ref1","first-page":"3","article-title":"Constant-approximation for minimum-weight (connected) dominating sets in unit disk graphs","author":"amb\u00fchl","year":"2006","journal-title":"APPROX LNCS 4110"},{"key":"ref20","first-page":"374","article-title":"Approximation algorithms for connected dominating sets. Algorithmica","volume":"20","author":"guha","year":"1998"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462105"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-008-9146-0"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9346-2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10631-6_71"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9720-6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9124-y"}],"event":{"name":"IEEE INFOCOM 2015 - IEEE Conference on Computer Communications","start":{"date-parts":[[2015,4,26]]},"location":"Kowloon, Hong Kong","end":{"date-parts":[[2015,5,1]]}},"container-title":["2015 IEEE Conference on Computer Communications (INFOCOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7172813\/7218353\/07218481.pdf?arnumber=7218481","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T15:51:05Z","timestamp":1567093865000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7218481\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/infocom.2015.7218481","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}