{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T06:48:35Z","timestamp":1769064515576,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2021,4,13]],"date-time":"2021-04-13T00:00:00Z","timestamp":1618272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,13]],"date-time":"2021-04-13T00:00:00Z","timestamp":1618272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976050"],"award-info":[{"award-number":["61976050"]}],"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":["61806082"],"award-info":[{"award-number":["61806082"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10489-021-02305-6","type":"journal-article","created":{"date-parts":[[2021,4,13]],"date-time":"2021-04-13T06:02:56Z","timestamp":1618293776000},"page":"8753-8767","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Towards efficient local search for the minimum total dominating set problem"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3073-4219","authenticated-orcid":false,"given":"Shuli","family":"Hu","sequence":"first","affiliation":[]},{"given":"Huan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yupan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ruizhi","family":"Li","sequence":"additional","affiliation":[]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Nan","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,13]]},"reference":[{"issue":"23","key":"2305_CR1","first-page":"555","volume":"3","author":"MR Gary","year":"1979","unstructured":"Gary MR, Johnson DS (1979) Computers and intractability: A guide to the theory of NP-completeness. J Assoc Comput 3(23):555\u2013565","journal-title":"J Assoc Comput"},{"issue":"11","key":"2305_CR2","doi-asserted-by":"publisher","first-page":"2127","DOI":"10.1109\/JSAC.2006.881606","volume":"24","author":"B Aoun","year":"2006","unstructured":"Aoun B, Boutaba R, Iraqi Y, Kenward G (2006) Gateway placement optimization in wireless mesh networks with qos constraints. IEEE J Sel Areas Commun 24(11):2127\u20132136","journal-title":"IEEE J Sel Areas Commun"},{"issue":"7","key":"2305_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.ipl.2014.02.002","volume":"114","author":"Y Belhoul","year":"2014","unstructured":"Belhoul Y, Yahiaoui S, Kheddouci H (2014) Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs. Inf Process Lett 114(7):339\u2013343","journal-title":"Inf Process Lett"},{"issue":"3","key":"2305_CR4","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.adhoc.2003.09.010","volume":"3","author":"K Akkaya","year":"2005","unstructured":"Akkaya K, Younis M (2005) A survey on routing protocols for wireless sensor networks. Ad hoc Netw 3(3):325\u2013349","journal-title":"Ad hoc Netw"},{"issue":"12","key":"2305_CR5","first-page":"1164","volume":"12","author":"S Balaji","year":"2013","unstructured":"Balaji S, Kannan K, Venkatakrishnan YB (2013) Total dominating set based algorithm for connected dominating set in ad hoc wireless networks. WSEAS Trans Math 12(12):1164\u20131172","journal-title":"WSEAS Trans Math"},{"issue":"3","key":"2305_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1002\/net.3230100304","volume":"10","author":"EJ Cockayne","year":"1980","unstructured":"Cockayne EJ, Dawes RM, Hedetniemi ST (1980) Total domination in graphs. Networks 10 (3):211\u2013219","journal-title":"Networks"},{"issue":"1","key":"2305_CR7","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.disc.2007.12.044","volume":"309","author":"MA Henning","year":"2009","unstructured":"Henning MA (2009) A survey of selected recent results on total domination in graphs. Discret Math 309(1):32\u201363","journal-title":"Discret Math"},{"key":"2305_CR8","doi-asserted-by":"crossref","unstructured":"Zhu J (2009) Approximation for minimum total dominating set. In: Proceedings of the 2nd international conference on interaction sciences: information technology, culture and human, ACM, 2009:119\u2013124","DOI":"10.1145\/1655925.1655948"},{"issue":"6","key":"2305_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.20852\/ntmsci.2018.312","volume":"4","author":"A Sasireka","year":"2018","unstructured":"Sasireka A, Muthuraj R (2018) Total domination on anti fuzzy graph. New Trends Math Sci 4(6):28\u201339","journal-title":"New Trends Math Sci"},{"issue":"3","key":"2305_CR10","doi-asserted-by":"publisher","first-page":"222","DOI":"10.3390\/math7030222","volume":"7","author":"F Yuan","year":"2019","unstructured":"Yuan F, Li C, Gao X, Yin M, Wang Y (2019) (2019). A novel hybrid algorithm for minimum total dominating set problem. Mathematics 7(3):222","journal-title":"Mathematics"},{"issue":"10","key":"2305_CR11","doi-asserted-by":"publisher","first-page":"253","DOI":"10.3390\/a13100253","volume":"13","author":"DH Smith","year":"2020","unstructured":"Smith DH, Montemanni R, Perkins S (2020) The use of an exact algorithm within a tabu search maximum clique algorithm. Algorithms 13(10):253","journal-title":"Algorithms"},{"key":"2305_CR12","doi-asserted-by":"crossref","unstructured":"Gao J, Chen J, Yin M, Chen R, Wang Y (2018) An exact algorithm for maximum k-Plexes in massive graphs. International Joint Conference on Artificial Intelligence","DOI":"10.24963\/ijcai.2018\/201"},{"key":"2305_CR13","doi-asserted-by":"crossref","unstructured":"Wang Y, Cai S, Pan S, Li X, Yin M (2020) Reduction and local search for weighted graph coloring problem. National Conference on Artificial Intelligence","DOI":"10.1609\/aaai.v34i03.5624"},{"key":"2305_CR14","doi-asserted-by":"crossref","unstructured":"Luo C, Hoos HH, Cai S, Lin Q, Zhang H, Zhang D (2019) Local search with efficient automatic configuration for minimum vertex cover. International Joint Conference on Artificial Intelligence","DOI":"10.24963\/ijcai.2019\/180"},{"key":"2305_CR15","doi-asserted-by":"crossref","unstructured":"Chen P, Wan H, Cai S, Li J, Chen H (2020) Local search with dynamic-threshold configuration checking and incremental neighborhood updating for maximum k-plex problem. National Conference on Artificial Intelligence","DOI":"10.1609\/aaai.v34i03.5613"},{"key":"2305_CR16","doi-asserted-by":"publisher","unstructured":"AlKasem HH, Menai MEB (2020) Stochastic local search for partial Max-SAT: an experimental evaluation. Artif Intell Rev 1\u201342. https:\/\/doi.org\/10.1007\/s10462-020-09908-4","DOI":"10.1007\/s10462-020-09908-4"},{"key":"2305_CR17","doi-asserted-by":"crossref","unstructured":"Wang Y, Cai S, Chen J, Yin M (2018) A fast local search algorithm for minimum weight dominating set problem on massive graphs. International Joint Conference on Artificial Intelligence","DOI":"10.24963\/ijcai.2018\/210"},{"issue":"1","key":"2305_CR18","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1613\/jair.3907","volume":"46","author":"S Cai","year":"2013","unstructured":"Cai S, Su K, Luo C, Sattar A (2013) NuMVC: an efficient local search algorithm for minimum vertex cover. J Artif Intell Res 46(1):687\u2013716","journal-title":"J Artif Intell Res"},{"issue":"2","key":"2305_CR19","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.artint.2016.11.001","volume":"2017","author":"C Luo","year":"2017","unstructured":"Luo C, Cai S, Su K, Huang W (2017) CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability. Artif Intell 2017(2):26\u201344","journal-title":"Artif Intell"},{"issue":"6","key":"2305_CR20","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/0305-0548(95)00063-1","volume":"23","author":"CR Houck","year":"1996","unstructured":"Houck CR, Joines JA, Kay MG (1996) Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems. Comput Oper Res 23(6):587\u2013 596","journal-title":"Comput Oper Res"},{"issue":"1","key":"2305_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1080\/0952813X.2019.1620869","volume":"32","author":"O Harrabi","year":"2020","unstructured":"Harrabi O, Chaouachi J (2020) Towards effective resolution approaches for solving the sum coloring problem. J Exp Theor Artif Intell 32(1):31\u201357","journal-title":"J Exp Theor Artif Intell"},{"issue":"3","key":"2305_CR22","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 II. Informs J Comput 1(3):190\u2013206","journal-title":"Informs J Comput"},{"issue":"5","key":"2305_CR23","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10732-014-9247-0","volume":"20","author":"JW Escobar","year":"2014","unstructured":"Escobar JW, Linfati R, Toth P, Baldoquin MG (2014) A hybrid granular Tabu search algorithm for the multi-depot vehicle routing problem. J Heuristics 20(5):483\u2013509","journal-title":"J Heuristics"},{"issue":"1","key":"2305_CR24","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1080\/0952813X.2017.1354082","volume":"30","author":"D Chalupa","year":"2018","unstructured":"Chalupa D (2018) On transitions in the behaviour of tabu search algorithm TabuCol for graph colouring. J Exp Theor Artif Intell 30(1):53\u201369","journal-title":"J Exp Theor Artif Intell"},{"key":"2305_CR25","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.asoc.2019.01.001","volume":"76","author":"T Dokeroglu","year":"2019","unstructured":"Dokeroglu T, Sevinc E, Cosar A (2019) Artificial bee colony optimization for the quadratic assignment problem. Appl Soft Comput 76:595\u2013606","journal-title":"Appl Soft Comput"},{"key":"2305_CR26","doi-asserted-by":"crossref","unstructured":"Arito F, Leguizam\u00f3n G (2009) Incorporating tabu search principles into aco algorithms, Springer, Berlin","DOI":"10.1007\/978-3-642-04918-7_10"},{"key":"2305_CR27","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.asoc.2018.08.047","volume":"73","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset M, Manogaran G, El-Shahat D, Mirjalili S (2018) Integrating the whale algorithm with tabu search for quadratic assignment problem: a new approach for locating hospital departments. Applied Soft Computing 73:530\u2013546","journal-title":"Applied Soft Computing"},{"key":"2305_CR28","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.cor.2018.04.004","volume":"96","author":"X Li","year":"2018","unstructured":"Li X, Zhu L, Baki F, Chaouch AB (2018) Tabu search and iterated local search for the cyclic bottleneck assignment problem. Comput Oper Res 96:120\u2013130","journal-title":"Comput Oper Res"},{"key":"2305_CR29","doi-asserted-by":"crossref","unstructured":"Cai S, Su K (2011) Local search with configuration checking for SAT. International Conference on Tools with Artificial Intelligence","DOI":"10.1109\/ICTAI.2011.18"},{"key":"2305_CR30","doi-asserted-by":"crossref","unstructured":"Luo C, Cai S, Wu W, Su K (2013) Focused random walk with configuration checking and break minimum for satisfiability. Principles and Practice of Constraint Programming","DOI":"10.1007\/978-3-642-40627-0_37"},{"issue":"6","key":"2305_CR31","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1111\/itor.12280","volume":"24","author":"Y Wang","year":"2017","unstructured":"Wang Y, Yin M, Ouyang D, Zhang L (2017) A novel local search algorithm with configuration checking and scoring mechanism for the set k-covering problem. Int Trans Oper Res 24(6):1463\u2013 1485","journal-title":"Int Trans Oper Res"},{"issue":"58","key":"2305_CR32","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1613\/jair.5205","volume":"2017","author":"Y Wang","year":"2017","unstructured":"Wang Y, Cai S, Yin M (2017) Local search for minimum weight dominating set with two-level configuration checking and frequency based scoring function. J Artif Intell Res 2017(58):267\u2013295","journal-title":"J Artif Intell Res"},{"issue":"2","key":"2305_CR33","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12293-016-0216-z","volume":"10","author":"S Hu","year":"2018","unstructured":"Hu S, Li R, Zhao P, Yin M (2018) A hybrid metaheuristic algorithm for generalized vertex cover problem. Memetic Comput 10(2):165\u2013176","journal-title":"Memetic Comput"},{"key":"2305_CR34","doi-asserted-by":"crossref","unstructured":"Li R, Cai S, Hu S, Yin M, Gao J (2018) NuMWVC: A novel local search for minimum weighted vertex cover problem. National Conference on Artificial Intelligence","DOI":"10.24963\/ijcai.2018\/196"},{"issue":"1","key":"2305_CR35","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1613\/jair.1815","volume":"25","author":"W Pullan","year":"2006","unstructured":"Pullan W, Hoos HH (2006) Dynamic local search for the maximum clique problem. J Artif Intell Res 25(1):159\u2013185","journal-title":"J Artif Intell Res"},{"issue":"1","key":"2305_CR36","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/evco.2009.17.1.3","volume":"17","author":"T Friedrich","year":"2009","unstructured":"Friedrich T, He J, Hebbinghaus N, Neumann F, Witt C (2009) Analyses of simple hybrid algorithms for the vertex cover problem. Evol Comput 17(1):3\u201319","journal-title":"Evol Comput"},{"key":"2305_CR37","doi-asserted-by":"crossref","unstructured":"Fan Y, Li N, Li C, Ma Z, Latecki LJ, Su K (2017) Restart and random walk in local search for maximum vertex weight cliques with evaluations in clustering aggregation. In: Proceedings of the 26th international joint conference on artificial intelligence, pp 622\u2013630","DOI":"10.24963\/ijcai.2017\/87"},{"key":"2305_CR38","doi-asserted-by":"crossref","unstructured":"Parkes AJ (2002) Scaling properties of pure random walk on random 3-SAT. Principles and Practice of Constraint Programming","DOI":"10.1007\/3-540-46135-3_50"},{"key":"2305_CR39","unstructured":"Mastrogiovanni M (2007) The clustering simulation framework: a simple Manual. \u2329 http:\/\/www.michele-mastrogiovanni.net\/software\/download\/README.pdf\u232a"},{"key":"2305_CR40","unstructured":"Jovanovic R, Tuba M, SimianD (2010) Ant colony optimization applied to minimum weight dominating set problem. The 12th WSEAS International Conference on Automatic Control, Modelling and Simulation (ACMOS\u201910)"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02305-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02305-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02305-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T05:07:37Z","timestamp":1636434457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02305-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,13]]},"references-count":40,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["2305"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02305-6","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,13]]},"assertion":[{"value":"2 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}