{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T00:24:19Z","timestamp":1723249459610},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62106040","61976050"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s00521-024-09665-3","type":"journal-article","created":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T04:01:51Z","timestamp":1714363311000},"page":"13833-13852","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A frequency and two-hop configuration checking-driven local search algorithm for the minimum weakly connected dominating set problem"],"prefix":"10.1007","volume":"36","author":[{"given":"Ruizhi","family":"Li","sequence":"first","affiliation":[]},{"given":"Jintao","family":"He","sequence":"additional","affiliation":[]},{"given":"Cuisong","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-3073-4219","authenticated-orcid":false,"given":"Shuli","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"9665_CR1","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0012-365X(96)00233-6","volume":"167\u2013168","author":"J Dunbar","year":"1997","unstructured":"Dunbar J, Grossman J, Hattingh J, Hedetniemi S, McRae A (1997) On weakly connected domination in graphs. Discrete Math 167\u2013168:261\u2013269","journal-title":"Discrete Math"},{"issue":"2","key":"9665_CR2","first-page":"175","volume":"3","author":"A Pathan","year":"2009","unstructured":"Pathan A, Hong C (2009) Weakly connected dominating set-based secure clustering and operation in distributed sensor networks. Int J Commun Netw Distrib Syst 3(2):175","journal-title":"Int J Commun Netw Distrib Syst"},{"issue":"2","key":"9665_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10878-010-9358-y","volume":"23","author":"H Du","year":"2010","unstructured":"Du H, Wu W, Shan S, Kim D, Lee W (2010) Constructing weakly connected dominating set for secure clustering in distributed sensor network. J Comb Optim 23(2):301\u2013307","journal-title":"J Comb Optim"},{"issue":"6","key":"9665_CR4","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.jpdc.2007.03.001","volume":"67","author":"H Bo","year":"2007","unstructured":"Bo H, Jia W (2007) Clustering wireless ad hoc networks with weakly connected dominating set. J Parallel Distrib Comput 67(6):727\u2013737","journal-title":"J Parallel Distrib Comput"},{"key":"9665_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.compeleceng.2015.03.034","volume":"48","author":"K Li","year":"2015","unstructured":"Li K, Leu J (2015) Weakly connected dominating set-assisted ant-based routing protocol for wireless ad-hoc networks. Comput Electr Eng 48:62\u201376","journal-title":"Comput Electr Eng"},{"issue":"1","key":"9665_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/s11227-009-0325-2","volume":"53","author":"Z Xu","year":"2009","unstructured":"Xu Z, Wang J, Srimani PK (2009) Distributed fault tolerant computation of weakly connected dominating set in ad hoc networks. J Supercomput 53(1):182\u2013195","journal-title":"J Supercomput"},{"doi-asserted-by":"crossref","unstructured":"Chen Y, Liestman A (2002). Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In: Third ACM International Symposium on Mobile Ad Hoc Networking and Computing, Lausanne, Switzerland School of Computing Science Simon Fraser University British Columbia, Canada, V5A 1S6","key":"9665_CR7","DOI":"10.1145\/513800.513821"},{"issue":"4","key":"9665_CR8","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.jcss.2005.04.002","volume":"71","author":"D Dubhashi","year":"2005","unstructured":"Dubhashi D, Mei A, Panconesi A, Radhakrishnan J, Srinivasan A (2005) Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. J Comput Syst Sci 71(4):467\u2013479","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"9665_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10766-014-0335-4","volume":"44","author":"Y Ding","year":"2014","unstructured":"Ding Y, Wang JZ, Srimani PK (2014) A linear time self-stabilizing algorithm for minimal weakly connected dominating sets. Int J Parallel Prog 44(1):151\u2013162","journal-title":"Int J Parallel Prog"},{"unstructured":"Niu D, Yin M (2022) A self-stabilizing memetic algorithm for minimum weakly connected dominating set problems. In the 2nd international workshop on heuristic search in industry (HSI), In: conjunction with the 31st international joint conference on artificial intelligence and the 25th European conference on artificial intelligence (IJCAI-ECAI 2022)","key":"9665_CR10"},{"key":"9665_CR11","doi-asserted-by":"publisher","first-page":"119338","DOI":"10.1016\/j.eswa.2022.119338","volume":"215","author":"D Niu","year":"2023","unstructured":"Niu D, Nie X, Zhang L, Zhang H, Yin M (2023) A greedy randomized adaptive search procedure (GRASP) for minimum weakly connected dominating set problem. Expert Syst Appl 215:119338","journal-title":"Expert Syst Appl"},{"issue":"9\u201310","key":"9665_CR12","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai S, Su K, Sattar A (2011) Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif Intell 175(9\u201310):1672\u20131696","journal-title":"Artif Intell"},{"key":"9665_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.artint.2013.09.001","volume":"204","author":"S Cai","year":"2013","unstructured":"Cai S, Su K (2013) Local search for boolean satisfiability with configuration checking and subscore. Artif Intell 204:75\u201398","journal-title":"Artif Intell"},{"key":"9665_CR14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1613\/jair.1.12618","volume":"71","author":"X Zhang","year":"2021","unstructured":"Zhang X, Li B, Cai S, Wang Y (2021) Efficient local search based on dynamic connectivity maintenance for minimum connected dominating set. J Artif Intell Res 71:89\u2013119","journal-title":"J Artif Intell Res"},{"key":"9665_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.5205","volume":"58","author":"Y Wang","year":"2017","unstructured":"Wang Y, Yin M, Cai S (2017) Local search for minimum weight dominating set with two-level configuration checking and frequency based scoring function. J Artif Intell Res 58:267\u2013295","journal-title":"J Artif Intell Res"},{"issue":"12","key":"9665_CR16","doi-asserted-by":"publisher","first-page":"8753","DOI":"10.1007\/s10489-021-02305-6","volume":"51","author":"S Hu","year":"2021","unstructured":"Hu S, Liu H, Wang Y, Li R, Yin M, Yang N (2021) Towards efficient local search for the minimum total dominating set problem. Appl Intell 51(12):8753\u20138767","journal-title":"Appl Intell"},{"issue":"3","key":"9665_CR17","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014Part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"1","key":"9665_CR18","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1007\/s00521-016-2429-y","volume":"28","author":"R Li","year":"2017","unstructured":"Li R, Hu S, Gao J, Zhou Y, Wang Y, Yin M (2017) GRASP for connected dominating set problems. Neural Comput Appl 28(1):1059\u20131067","journal-title":"Neural Comput Appl"},{"issue":"12","key":"9665_CR19","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.3390\/math7121173","volume":"7","author":"R Li","year":"2019","unstructured":"Li R, Hu S, Liu H, Li R, Ouyang D, Yin M (2019) Multi-start local search algorithm for the minimum connected dominating set problems. Mathematics 7(12):1173","journal-title":"Mathematics"},{"issue":"9","key":"9665_CR20","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1080\/01605682.2021.1952117","volume":"73","author":"R Li","year":"2022","unstructured":"Li R, Wang Y, Liu H, Li R, Hu S, Yin M (2022) A restart local search algorithm with tabu method for the minimum weighted connected dominating set problem. J Oper Res Soc 73(9):2090\u20132103","journal-title":"J Oper Res Soc"},{"key":"9665_CR21","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.ins.2016.08.053","volume":"372","author":"R Li","year":"2016","unstructured":"Li R, Hu S, Zhang H, Yin M (2016) An efficient local search framework for the minimum weighted vertex cover problem. Inf Sci 372:428\u2013445","journal-title":"Inf Sci"},{"key":"9665_CR22","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.ins.2018.08.052","volume":"471","author":"S Cai","year":"2018","unstructured":"Cai S, Li Y, Hou W, Wang H (2018) Towards faster local search for minimum weight vertex cover on massive graphs. Inf Sci 471:64\u201379","journal-title":"Inf Sci"},{"key":"9665_CR23","doi-asserted-by":"publisher","first-page":"103230","DOI":"10.1016\/j.artint.2019.103230","volume":"280","author":"Y Wang","year":"2020","unstructured":"Wang Y, Cai S, Chen J, Yin M (2020) SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem. Artif Intell 280:103230","journal-title":"Artif Intell"},{"key":"9665_CR24","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ins.2018.07.037","volume":"466","author":"W Sun","year":"2018","unstructured":"Sun W, Hao J, Lai X, Wu Q (2018) Adaptive feasible and infeasible tabu search for weighted vertex coloring. Inf Sci 466:203\u2013219","journal-title":"Inf Sci"},{"issue":"1","key":"9665_CR25","doi-asserted-by":"publisher","first-page":"133","DOI":"10.2298\/CSIS110927038J","volume":"10","author":"R Jovanovic","year":"2013","unstructured":"Jovanovic R, Tuba M (2013) Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem. Comput Sci Inf Syst 10(1):133\u2013149","journal-title":"Comput Sci Inf Syst"},{"issue":"11","key":"9665_CR26","doi-asserted-by":"publisher","first-page":"2382","DOI":"10.1080\/01605682.2022.2147458","volume":"74","author":"R Tai","year":"2023","unstructured":"Tai R, Ouyang D, Li R, Zhang L (2023) ILSGVCP: an improved local search algorithm for generalized vertex cover problem. J Oper Res Soc 74(11):2382\u20132390","journal-title":"J Oper Res Soc"},{"issue":"4","key":"9665_CR27","first-page":"1","volume":"17","author":"S Pan","year":"2023","unstructured":"Pan S, Ma Y, Wang Y, Zhou Z, Ji J, Yin M (2023) An improved master-apprentice evolutionary algorithm for minimum independent dominating set problem. Front Comp Sci 17(4):1\u201314","journal-title":"Front Comp Sci"},{"key":"9665_CR28","doi-asserted-by":"publisher","first-page":"109619","DOI":"10.1016\/j.knosys.2022.109619","volume":"254","author":"R Li","year":"2022","unstructured":"Li R, Liu S, Wang F, Gao J, Liu H, Hu S, Yin M (2022) A restart local search algorithm with relaxed configuration checking strategy for the minimum k-dominating set problem. Knowl-Based Syst 254:109619","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"9665_CR29","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1007\/s10489-022-03531-2","volume":"53","author":"Y Zhou","year":"2023","unstructured":"Zhou Y, Fan M, Liu X, Xu X, Wang Y, Yin M (2023) A master-apprentice evolutionary algorithm for maximum weighted set k-covering problem. Appl Intell 53(2):1912\u20131944","journal-title":"Appl Intell"},{"issue":"4","key":"9665_CR30","doi-asserted-by":"publisher","first-page":"359","DOI":"10.3390\/math7040359","volume":"7","author":"S Hu","year":"2019","unstructured":"Hu S, Liu H, Wu X, Li R, Zhou J, Wang J (2019) A hybrid framework combining genetic algorithm with iterated local search for the dominating tree problem. Mathematics 7(4):359","journal-title":"Mathematics"},{"key":"9665_CR31","doi-asserted-by":"publisher","first-page":"120353","DOI":"10.1016\/j.eswa.2023.120353","volume":"229","author":"D Niu","year":"2023","unstructured":"Niu D, Liu B, Yin M, Zhou Y (2023) A new local search algorithm with greedy crossover restart for the dominating tree problem. Expert Syst Appl 229:120353","journal-title":"Expert Syst Appl"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-09665-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-024-09665-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-024-09665-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T18:11:51Z","timestamp":1723227111000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-024-09665-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,29]]},"references-count":31,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["9665"],"URL":"https:\/\/doi.org\/10.1007\/s00521-024-09665-3","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2024,4,29]]},"assertion":[{"value":"2 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper. The authors declare the following financial interests\/personal relationships which may be considered as potential competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}