{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T18:35:25Z","timestamp":1777487725429,"version":"3.51.4"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"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":"crossref","award":["11471005"],"award-info":[{"award-number":["11471005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11371287"],"award-info":[{"award-number":["11371287"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"US National Science Foundation (NSF)","award":["HRD-1345219"],"award-info":[{"award-number":["HRD-1345219"]}]},{"name":"US National Science Foundation (NSF)","award":["HRD-1533653"],"award-info":[{"award-number":["HRD-1533653"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Research Funds of Renmin University of China","award":["10XNJ032"],"award-info":[{"award-number":["10XNJ032"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1109\/tnet.2015.2475335","type":"journal-article","created":{"date-parts":[[2015,9,22]],"date-time":"2015-09-22T18:36:05Z","timestamp":1442946965000},"page":"2690-2701","source":"Crossref","is-referenced-by-count":17,"title":["On Approximating Minimum 3-Connected $m$-Dominating Set Problem in Unit Disk Graph"],"prefix":"10.1109","volume":"24","author":[{"given":"Bei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donghyun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deying","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingyi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alade O.","family":"Tokuta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaolin","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90358-O"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009201"},{"key":"ref12","first-page":"81a","article-title":"On constructing <formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex> <\/formula>-connected <formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex><\/formula>-dominating set in wireless network","author":"dai","year":"2005","journal-title":"Proc 19th IEEE IPDPS"},{"key":"ref13","first-page":"1","article-title":"A new constant factor approximation for computing 3-connected <formula formulatype=\"inline\"><tex Notation=\"TeX\">$m$<\/tex> <\/formula>-dominating sets in homogeneous wireless networks","author":"kim","year":"2010","journal-title":"Proc 29th IEEE INFOCOM"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2227791"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9124-y"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2009.051053"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.025"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1374718.1374720"},{"key":"ref19","first-page":"1","article-title":"Constructing <formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex><\/formula>-connected <formula formulatype=\"inline\"><tex Notation=\"TeX\">$m$<\/tex><\/formula>-dominating sets in wireless sensor networks","author":"wu","year":"2007","journal-title":"Proc MILCOM"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/0202012"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2014.10.013"},{"key":"ref27","first-page":"1","article-title":"Localized construction of connected dominating set in wireless networks","author":"li","year":"2004","journal-title":"Proc NSF TAWN"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/313451.313525"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88582-5_15"},{"key":"ref5","first-page":"89","article-title":"Constructing connected dominating sets with bounded diameters in wireless networks","author":"li","year":"2007","journal-title":"Proc 2nd WASA"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.74"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88582-5_52"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2164620"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.55"},{"key":"ref1","first-page":"1796","article-title":"A better constant approximation of minimum 3-connected <formula formulatype=\"inline\"><tex Notation=\"TeX\">$m$<\/tex><\/formula>-dominating set problem in unit disk graph using Tutte decomposition","author":"wang","year":"2015","journal-title":"Proc 34th IEEE INFOCOM"},{"key":"ref20","first-page":"83","article-title":"Construction algorithms for <formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex> <\/formula>-connected <formula formulatype=\"inline\"><tex Notation=\"TeX\">$m$<\/tex><\/formula>-dominating sets in wireless sensor networks","author":"wu","year":"2008","journal-title":"Proc 9th ACM MobiHoc"},{"key":"ref22","article-title":"A greedy algorithm for the minimum 2-connected <formula formulatype=\"inline\"><tex Notation=\"TeX\">$m$<\/tex><\/formula>-fold dominating set problem","author":"shi","year":"2014","journal-title":"J Combin Optimiz"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9346-2"},{"key":"ref24","volume":"173","author":"diestel","year":"2005","journal-title":"Graduate Texts in Mathematics"},{"key":"ref23","doi-asserted-by":"crossref","DOI":"10.3138\/9781487584863","author":"tutte","year":"1966","journal-title":"Connectivity in Graphs"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"148r","DOI":"10.37236\/872","article-title":"A complete grammar for decomposing a family of graphs into 3-connected components","volume":"15","author":"chapuy","year":"2008","journal-title":"Electron J Combinatorics"},{"key":"ref25","author":"west","year":"2001","journal-title":"Introduction to Graph Theory"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/7590206\/07273985.pdf?arnumber=7273985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:45:35Z","timestamp":1642005935000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7273985\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":28,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2015.2475335","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10]]}}}