{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:43:57Z","timestamp":1765039437719,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61763003","61502111","61806082","61503074"],"award-info":[{"award-number":["61763003","61502111","61806082","61503074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2875499","type":"journal-article","created":{"date-parts":[[2018,10,15]],"date-time":"2018-10-15T18:25:34Z","timestamp":1539627934000},"page":"62062-62075","source":"Crossref","is-referenced-by-count":8,"title":["An Efficient Local Search Algorithm for the Minimum $k$ -Dominating Set Problem"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2915-8242","authenticated-orcid":false,"given":"Ruizhi","family":"Li","sequence":"first","affiliation":[]},{"given":"Huan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xiaoli","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2769100"},{"key":"ref33","first-page":"173","article-title":"Ant colony optimization applied to minimum weight dominating set problem","volume":"146","author":"jovanovic","year":"2010","journal-title":"Plant Physiol"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s40313-016-0234-6"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2723538"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2611520"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-2172-9"},{"key":"ref36","first-page":"8107","article-title":"NuMWVC: A novel local search for minimum weighted vertex cover problem","author":"li","year":"2018","journal-title":"Proc AAAI"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2018.02.084"},{"journal-title":"The Clustering Simulation Framework A Simple Manual","year":"2007","author":"mastrogiovanni","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2010.05.147"},{"key":"ref11","first-page":"1","article-title":"On k-domination and j-independence in graphs","volume":"28","author":"hansberg","year":"2013","journal-title":"Graphs Combinat"},{"key":"ref12","first-page":"105","article-title":"Vertices contained in all or in no minimum k-dominating sets of a tree","volume":"11","author":"meddah","year":"2014","journal-title":"AKCE Int'l J Graphs and Combinatorics"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.06.016"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.07.001"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-540-30559-0_21","article-title":"Exact (exponential) algorithms for the dominating set problem","author":"fomin","year":"2004","journal-title":"Proc Int Workshop Graph-Theoretic Concepts Comput Sci"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/11602613_58"},{"key":"ref17","first-page":"457","article-title":"Hybrid genetic algorithm for minimum dominating set problem","author":"hedar","year":"2010","journal-title":"Proc Int Conf Comput Sci Appl"},{"key":"ref18","first-page":"165","article-title":"Parallel genetic algorithm for minimum dominating set problem","author":"giap","year":"2014","journal-title":"Proc Int Conf Comput Manage Telecommun"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.10.033"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2799953"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/11890348_34"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-015-5377-8"},{"key":"ref3","first-page":"1473","article-title":"Optimization in wireless networks","volume":"24","author":"gorce","year":"1964","journal-title":"Cancer Res"},{"key":"ref6","first-page":"12014","article-title":"Generalized minimum dominating set and application in automatic text summarization","volume":"699","author":"xu","year":"2016","journal-title":"Proc Int Meeting High-Dimensional Data-Driven Sci"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2683718"},{"key":"ref5","first-page":"984","article-title":"Multi-document summarization via the minimum dominating set","author":"shen","year":"2010","journal-title":"Proc Int Conf on Computational Linguistics (COLING)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IIH-MSP.2014.186"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9530-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-008-0131-8"},{"key":"ref9","first-page":"202","article-title":"Incremental construction of k-dominating sets in wireless sensor networks","author":"mathieu","year":"2006","journal-title":"Principles of Distributed Systems"},{"journal-title":"Graph Theory with Applications to Algorithms and Computer Science","year":"1985","author":"alavi","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-011-0043-y"},{"key":"ref22","first-page":"1","article-title":"A novel local search algorithm for the minimum capacitated dominating set","volume":"3","author":"li","year":"2017","journal-title":"J Oper Res Soc"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/728"},{"key":"ref24","first-page":"434","article-title":"Configuration checking with aspiration in local search for SAT","author":"cai","year":"2012","journal-title":"Proc AAAI"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2011.18"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2343242"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2346196"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08492522.pdf?arnumber=8492522","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T18:30:19Z","timestamp":1643221819000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8492522\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2875499","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}