{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T02:10:11Z","timestamp":1727748611343},"reference-count":49,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Knowledge-Based Systems"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1016\/j.knosys.2022.109619","type":"journal-article","created":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T15:46:05Z","timestamp":1660059965000},"page":"109619","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["A restart local search algorithm with relaxed configuration checking strategy for the minimumk<\/mml:mi><\/mml:math>-dominating set problem"],"prefix":"10.1016","volume":"254","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-2915-8242","authenticated-orcid":false,"given":"Ruizhi","family":"Li","sequence":"first","affiliation":[]},{"given":"Siqi","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Fangzhou","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Huan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Shuli","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.knosys.2022.109619_b1","series-title":"Proceedings of the 23rd International Conference on Computational Linguistics","first-page":"984","article-title":"Multi-document summarization via the minimum dominating set","author":"Shen","year":"2010"},{"issue":"6","key":"10.1016\/j.knosys.2022.109619_b2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.3390\/jrfm15060253","article-title":"Supervision of banking networks using the multivariate threshold-minimum dominating set (mT-MDS)","volume":"15","author":"Gogas","year":"2022","journal-title":"J. Risk Financ. Manag."},{"issue":"3","key":"10.1016\/j.knosys.2022.109619_b3","doi-asserted-by":"crossref","first-page":"79","DOI":"10.3390\/a14030079","article-title":"An improved greedy heuristic for the minimum positive influence dominating set problem in social networks","volume":"14","author":"Bouamama","year":"2021","journal-title":"Algorithms"},{"issue":"3","key":"10.1016\/j.knosys.2022.109619_b4","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10878-012-9530-7","article-title":"On the approximability of positive influence dominating set in social networks","volume":"27","author":"Dinh","year":"2014","journal-title":"J. Comb. Optim."},{"issue":"11","key":"10.1016\/j.knosys.2022.109619_b5","doi-asserted-by":"crossref","first-page":"11923","DOI":"10.1109\/TVT.2021.3085833","article-title":"A dominating set-based sleep scheduling in energy harvesting WBANs","volume":"70","author":"Zhang","year":"2021","journal-title":"IEEE Trans. Veh. Technol."},{"key":"10.1016\/j.knosys.2022.109619_b6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.dam.2016.10.016","article-title":"The probabilistic minimum dominating set problem","volume":"234","author":"Boria","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.knosys.2022.109619_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.adhoc.2019.102023","article-title":"Minimum connected dominating sets in heterogeneous 3D wireless ad hoc networks","volume":"97","author":"Bai","year":"2020","journal-title":"Ad Hoc Netw."},{"issue":"5","key":"10.1016\/j.knosys.2022.109619_b8","doi-asserted-by":"crossref","first-page":"12795","DOI":"10.1007\/s10586-018-1760-8","article-title":"Minimum connected dominating set based RSU allocation for smartcloud vehicles in VANET","volume":"22","author":"Chinnasamy","year":"2019","journal-title":"Cluster Comput."},{"key":"10.1016\/j.knosys.2022.109619_b9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ymeth.2015.12.017","article-title":"Minimum dominating set-based methods for analyzing biological networks","volume":"102","author":"Nacher","year":"2016","journal-title":"Methods"},{"key":"10.1016\/j.knosys.2022.109619_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipl.2021.106206","article-title":"An improved exact algorithm for minimum dominating set in chordal graphs","volume":"174","author":"Abu-Khzam","year":"2022","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.knosys.2022.109619_b11","series-title":"International Conference on Current Trends in Theory and Practice of Computer Science","first-page":"237","article-title":"Nonblocker: parameterized algorithmics for minimum dominating set","author":"Dehne","year":"2006"},{"issue":"2\u20133","key":"10.1016\/j.knosys.2022.109619_b12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0166-218X(86)90089-2","article-title":"A linear algorithm for finding a minimum dominating set in a cactus","volume":"13","author":"Hedetniemi","year":"1986","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.knosys.2022.109619_b13","first-page":"62","article-title":"New algorithms for minimum dominating set in any graphs","volume":"5","author":"Karci\u0307","year":"2020","journal-title":"Comput. Sci."},{"issue":"12","key":"10.1016\/j.knosys.2022.109619_b14","doi-asserted-by":"crossref","first-page":"339","DOI":"10.3390\/a13120339","article-title":"A performance study of some approximation algorithms for computing a small dominating set in a graph","volume":"13","author":"Li","year":"2020","journal-title":"Algorithms"},{"key":"10.1016\/j.knosys.2022.109619_b15","doi-asserted-by":"crossref","unstructured":"Shaowei Cai, Wenying Hou, Yiyuan Wang, Chuan Luo, Qingwei Lin, Two-goal local search and inference rules for minimum dominating set, in: Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence, 2021, pp. 1467\u20131473.","DOI":"10.24963\/ijcai.2020\/204"},{"key":"10.1016\/j.knosys.2022.109619_b16","first-page":"1","article-title":"A heuristic approximation algorithm of minimum dominating set based on rough set theory","author":"Guan","year":"2022","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.knosys.2022.109619_b17","article-title":"Incremental construction of k-dominating sets in wireless sensor networks","volume":"5","author":"Couture","year":"2008","journal-title":"Adhoc Sens. Wirel. Netw."},{"key":"10.1016\/j.knosys.2022.109619_b18","series-title":"2014 Tenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing","first-page":"723","article-title":"Self-stabilizing distributed formation of minimal k-dominating sets in mobile ad hoc networks","author":"Yen","year":"2014"},{"key":"10.1016\/j.knosys.2022.109619_b19","series-title":"26th IEEE International Conference on Distributed Computing Systems","first-page":"68","article-title":"Fault-tolerant clustering in ad hoc and sensor networks","author":"Kuhn","year":"2006"},{"year":"2012","series-title":"Novel Morphological Algorithms for Dominating Sets on Graphs with Applications to Image Analysis","author":"Potluri","key":"10.1016\/j.knosys.2022.109619_b20"},{"key":"10.1016\/j.knosys.2022.109619_b21","unstructured":"Bangpeng Yao, Fei\u00a0Fei Li, Action Recognition with Exemplar Based 2.5D Graph Matching, in: European Conference on Computer Vision, 2012."},{"issue":"1","key":"10.1016\/j.knosys.2022.109619_b22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-011-1040-3","article-title":"K-domination and k-independence in graphs: A survey","volume":"28","author":"Chellali","year":"2012","journal-title":"Graphs Combin."},{"issue":"1","key":"10.1016\/j.knosys.2022.109619_b23","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1137\/1024022","article-title":"Computers and intractability: a guide to the theory of NP-completeness (Michael R. Garey and David s. Johnson)","volume":"24","author":"Hartmanis","year":"1982","journal-title":"Siam Rev."},{"issue":"12","key":"10.1016\/j.knosys.2022.109619_b24","doi-asserted-by":"crossref","first-page":"3201","DOI":"10.1109\/TPDS.2013.2297100","article-title":"Game-theoretic approach to self-stabilizing distributed formation of minimal multi-dominating sets","volume":"25","author":"Yen","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"10.1016\/j.knosys.2022.109619_b25","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1093\/ietfec\/e88-a.5.1109","article-title":"A self-stabilizing approximation algorithm for the distributed minimum k-domination","volume":"88","author":"Kamei","year":"2005","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"3","key":"10.1016\/j.knosys.2022.109619_b26","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/j.camwa.2007.01.021","article-title":"A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model","volume":"54","author":"Huang","year":"2007","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"10.1016\/j.knosys.2022.109619_b27","article-title":"A linear-time self-stabilizing algorithm for the minimal 2-dominating set problem in general networks","volume":"24","author":"Huang","year":"2008","journal-title":"J. Inform. Sci. Eng."},{"key":"10.1016\/j.knosys.2022.109619_b28","doi-asserted-by":"crossref","first-page":"62062","DOI":"10.1109\/ACCESS.2018.2875499","article-title":"An efficient local search algorithm for the minimum k-dominating set problem","volume":"6","author":"Li","year":"2018","journal-title":"IEEE Access"},{"issue":"9\u201310","key":"10.1016\/j.knosys.2022.109619_b29","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","article-title":"Local search with edge weighting and configuration checking heuristics for minimum vertex cover","volume":"175","author":"Cai","year":"2011","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/j.knosys.2022.109619_b30","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search\u2014Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA J. Comput."},{"issue":"1","key":"10.1016\/j.knosys.2022.109619_b31","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.ejor.2021.02.049","article-title":"A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic","volume":"295","author":"Melo","year":"2021","journal-title":"European J. Oper. Res."},{"issue":"2","key":"10.1016\/j.knosys.2022.109619_b32","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/j.ejor.2019.11.010","article-title":"A greedy randomized adaptive search procedure for the orienteering problem with hotel selection","volume":"283","author":"Sohrabi","year":"2020","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.knosys.2022.109619_b33","series-title":"2011 IEEE 23rd International Conference on Tools with Artificial Intelligence","first-page":"59","article-title":"Local search with configuration checking for SAT","author":"Cai","year":"2011"},{"key":"10.1016\/j.knosys.2022.109619_b34","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2019.103230","article-title":"SCCWalk: An efficient local search algorithm and its improvements for maximum weight clique problem","volume":"280","author":"Wang","year":"2020","journal-title":"Artificial Intelligence"},{"year":"2022","series-title":"NukCP: An improved local search algorithm for maximum k-club problem","author":"Chen","key":"10.1016\/j.knosys.2022.109619_b35"},{"key":"10.1016\/j.knosys.2022.109619_b36","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.108000","article-title":"Combining max\u2013min ant system with effective local search for solving the maximum set k-covering problem","volume":"239","author":"Zhou","year":"2022","journal-title":"Knowl.-Based Syst."},{"issue":"2","key":"10.1016\/j.knosys.2022.109619_b37","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1016\/j.ejor.2021.02.015","article-title":"An improved configuration checking-based algorithm for the unicost set covering problem","volume":"294","author":"Wang","year":"2021","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.knosys.2022.109619_b38","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2019.104867","article-title":"Local search for diversified top-k clique search problem","volume":"116","author":"Wu","year":"2020","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.knosys.2022.109619_b39","unstructured":"Shaowei Cai, Kaile Su, Configuration checking with aspiration in local search for SAT, in: Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012."},{"key":"10.1016\/j.knosys.2022.109619_b40","unstructured":"Shaowei Cai, Kaile Su, Qingliang Chen, EWLS: A new local search for minimum vertex cover, in: Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010."},{"issue":"9","key":"10.1016\/j.knosys.2022.109619_b41","doi-asserted-by":"crossref","first-page":"1498","DOI":"10.1080\/01605682.2019.1621218","article-title":"NuMWVC: A novel local search for minimum weighted vertex cover problem","volume":"71","author":"Li","year":"2020","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.knosys.2022.109619_b42","first-page":"1","article-title":"A restart local search algorithm with tabu method for the minimum weighted connected dominating set problem","author":"Li","year":"2021","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.knosys.2022.109619_b43","unstructured":"Qatar\u00a0Serbia Romania, Ant colony optimization applied to minimum weight dominating set problem, in: Proceedings of the 12th WSEAS International Conference on Automatic Control, Modelling & Simulation, Catania, Italy, 2010, pp. 29\u201331."},{"issue":"1","key":"10.1016\/j.knosys.2022.109619_b44","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10044-013-0364-4","article-title":"A clustering ensemble framework based on selection of fuzzy weighted clusters in a locally adaptive clustering algorithm","volume":"18","author":"Parvin","year":"2015","journal-title":"Pattern Anal. Appl."},{"key":"10.1016\/j.knosys.2022.109619_b45","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2022.105139","article-title":"Parameter adaptation-based ant colony optimization with dynamic hybrid mechanism","volume":"114","author":"Zhou","year":"2022","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.knosys.2022.109619_b46","first-page":"1","article-title":"Robust visual tracking for UAVs with dynamic feature weight selection","author":"An","year":"2022","journal-title":"Appl. Intell."},{"key":"10.1016\/j.knosys.2022.109619_b47","article-title":"An enhanced MSIQDE algorithm with novel multiple strategies for global optimization problems","author":"Deng","year":"2020","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"key":"10.1016\/j.knosys.2022.109619_b48","article-title":"A novel gate resource allocation method using improved PSO-based QEA","author":"Deng","year":"2020","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"10.1016\/j.knosys.2022.109619_b49","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/j.ins.2016.08.053","article-title":"An efficient local search framework for the minimum weighted vertex cover problem","volume":"372","author":"Li","year":"2016","journal-title":"Inform. Sci."}],"container-title":["Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705122008164?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950705122008164?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T01:51:10Z","timestamp":1727747470000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950705122008164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":49,"alternative-id":["S0950705122008164"],"URL":"https:\/\/doi.org\/10.1016\/j.knosys.2022.109619","relation":{},"ISSN":["0950-7051"],"issn-type":[{"type":"print","value":"0950-7051"}],"subject":[],"published":{"date-parts":[[2022,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A restart local search algorithm with relaxed configuration checking strategy for the minimum -dominating set problem","name":"articletitle","label":"Article Title"},{"value":"Knowledge-Based Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.knosys.2022.109619","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"109619"}}