{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T03:52:04Z","timestamp":1773201124827,"version":"3.50.1"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1109\/infocom.2016.7524456","type":"proceedings-article","created":{"date-parts":[[2016,7,28]],"date-time":"2016-07-28T16:47:54Z","timestamp":1469724474000},"page":"1-8","source":"Crossref","is-referenced-by-count":22,"title":["Performance-guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless networks"],"prefix":"10.1109","author":[{"given":"Zhao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuchang","family":"Mo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.08.037"},{"key":"ref32","author":"wang","year":"0","journal-title":"A better constant approximation for minimum 3-connected m-dominating set problem in unit disk graph using Tutte decomposition to appear in INFOCOM'15"},{"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-013-9638-4"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830909000361"},{"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"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17458-2_21"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934967"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9690-0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13705"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830909000105"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009201"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/0202012"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462105"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830909000087"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10631-6_71"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019411"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.12.010"},{"key":"ref27","article-title":"Connectivity in Graphs","volume":"15","author":"tutte","year":"1966","journal-title":"Expositiones Math"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1980-057-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.17"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2008.15"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1997.605303"},{"key":"ref8","author":"du","year":"2011","journal-title":"Design and Analysis of Approximation Algorithms"},{"key":"ref7","first-page":"167","article-title":"Analysis of greedy approximations with nonsubmodular potential functions","author":"du","year":"2008","journal-title":"SODA'08"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/net.10097"},{"key":"ref9","author":"du","year":"2012","journal-title":"Connected Dominating Set Theory and Applications"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","author":"bondy","year":"2008","journal-title":"Graph Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.356"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5131-0_9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9346-2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9124-y"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.08.013"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.025"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9720-6"}],"event":{"name":"IEEE INFOCOM 2016 - IEEE Conference on Computer Communications","location":"San Francisco, CA, USA","start":{"date-parts":[[2016,4,10]]},"end":{"date-parts":[[2016,4,14]]}},"container-title":["IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7515093\/7524326\/07524456.pdf?arnumber=7524456","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T15:27:31Z","timestamp":1498318051000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7524456\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/infocom.2016.7524456","relation":{},"subject":[],"published":{"date-parts":[[2016,4]]}}}