{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:24:58Z","timestamp":1768559098751,"version":"3.49.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61222201"],"award-info":[{"award-number":["61222201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11531011"],"award-info":[{"award-number":["11531011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572442"],"award-info":[{"award-number":["61572442"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Xinjiang Talent Youth Project","award":["2013711011"],"award-info":[{"award-number":["2013711011"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1109\/tnet.2016.2607723","type":"journal-article","created":{"date-parts":[[2016,9,28]],"date-time":"2016-09-28T18:17:03Z","timestamp":1475086623000},"page":"925-933","source":"Crossref","is-referenced-by-count":36,"title":["Approximation Algorithm for Minimum Weight Fault-Tolerant Virtual Backbone in Unit Disk Graphs"],"prefix":"10.1109","volume":"25","author":[{"given":"Yishuo","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4191-7598","authenticated-orcid":false,"given":"Zhao","family":"Zhang","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":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2007.4454774"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.08.037"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2008.15"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019411"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.025"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9720-6"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218513"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218561"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2227791"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2009.051053"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1997.605303"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-008-9384-9"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-1701-9","author":"du","year":"2012","journal-title":"Design and Analysis of Approximation Algorithms"},{"key":"ref12","author":"du","year":"2012","journal-title":"Connected Dominating Set Theory and Applications"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7997-1_42"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9690-0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12450-1_13"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45535-3_10"},{"key":"ref17","article-title":"Constant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs","author":"fukunaga","year":"0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1167935.1167941"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743463"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2390176.2390177"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2432622.2432628"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9346-2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-23830-1_8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/net.10097"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9124-y"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","author":"bondy","year":"2008","journal-title":"Graph Theory"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1016\/j.jpdc.2005.12.010","article-title":"On constructing k-connected k-dominating set in wireless ad hoc and sensor networks","volume":"66","author":"dai","year":"2006","journal-title":"J Parallel Distrib Comput"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)71047-1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2004.1311452"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.11.015"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830909000105"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.06.022"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-008-9146-0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009201"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524456"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462105"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2531688"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90284-M"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-009-9229-6"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10631-6_71"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9638-4"},{"key":"ref25","first-page":"898","article-title":"A PTAS for the weighted unit disk cover problem","author":"li","year":"2015","journal-title":"Proc ICALP"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/7900486\/07579144.pdf?arnumber=7579144","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:08:37Z","timestamp":1642003717000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7579144\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":45,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2016.2607723","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4]]}}}