{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T11:05:46Z","timestamp":1779793546540,"version":"3.53.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001501","name":"University Grants Commission","doi-asserted-by":"publisher","award":["Maulana Azad National Fellowship"],"award-info":[{"award-number":["Maulana Azad National Fellowship"]}],"id":[{"id":"10.13039\/501100001501","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s10489-026-07199-w","type":"journal-article","created":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T15:03:05Z","timestamp":1776697385000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Metaheuristic approaches for maximum general budgeted dominating set problem"],"prefix":"10.1007","volume":"56","author":[{"given":"Mohd Danish","family":"Rasheed","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3585-4957","authenticated-orcid":false,"given":"Alok","family":"Singh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,20]]},"reference":[{"key":"7199_CR1","doi-asserted-by":"publisher","first-page":"107,351","DOI":"10.1016\/j.asoc.2021.107351","volume":"106","author":"B Akay","year":"2021","unstructured":"Akay B, Karaboga D, Gorkemli B, Kaya E (2021) A survey on the artificial bee colony algorithm variants for binary, integer and mixed integer programming problems. Appl Soft Comput 106:107,351","journal-title":"Appl Soft Comput"},{"key":"7199_CR2","doi-asserted-by":"publisher","first-page":"100,167","DOI":"10.1016\/j.osnem.2021.100167","volume":"26","author":"R Cantini","year":"2021","unstructured":"Cantini R, Marozzo F, Mazza S, Talia D, Trunfio P (2021) A weighted artificial bee colony algorithm for influence maximization. Online Soc Netw Media 26:100,167","journal-title":"Online Soc Netw Media"},{"key":"7199_CR3","volume-title":"Handbook of genetic algorithms","author":"L Davis","year":"1991","unstructured":"Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold, New York"},{"key":"7199_CR4","unstructured":"Gary MR, Johnson DS (1979) Computers and intractability: A guide to the theory of np-completeness"},{"key":"7199_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2022.07.039","volume":"932","author":"W Hong","year":"2022","unstructured":"Hong W, Ran Y, Zhang Z (2022) Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph. Theoret Comput Sci 932:13\u201320","journal-title":"Theoret Comput Sci"},{"key":"7199_CR6","doi-asserted-by":"publisher","first-page":"126,480","DOI":"10.1016\/j.physa.2021.126480","volume":"586","author":"J Jabari Lotf","year":"2022","unstructured":"Jabari Lotf J, Abdollahi Azgomi M, Ebrahimi Dishabi MR (2022) An improved influence maximization method for social networks based on genetic algorithm. XXPhys A 586:126,480","journal-title":"XXPhys A"},{"key":"7199_CR7","unstructured":"Jovanovic R, Tuba M, Simian D (2010) Ant colony optimization applied to minimum weight dominating set problem. In: Proceedings of the 12th WSEAS international conference on automatic control, modelling & simulation, pp 322\u2013326. World Scientific and Engineering Academy and Society (WSEAS), Stevens Point, Wisconsin, USA"},{"key":"7199_CR8","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Tech. rep., Technical Report TR06, Computer Engineering Department, Engineering Faculty, Erciyes University, Turkey"},{"key":"7199_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (abc) algorithm and applications. Artif Intell Rev 42:21\u201357","journal-title":"Artif Intell Rev"},{"key":"7199_CR10","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"issue":"1","key":"7199_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller S, Moss A, Naor JS (1999) The budgeted maximum coverage problem. Inf Process Lett 70(1):39\u201345","journal-title":"Inf Process Lett"},{"issue":"2","key":"7199_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1137\/0604028","volume":"4","author":"N Megiddo","year":"1983","unstructured":"Megiddo N, Zemel E, Hakimi SL (1983) The maximum coverage location problem. SIAM J Algebraic Discrete Methods 4(2):253\u2013261","journal-title":"SIAM J Algebraic Discrete Methods"},{"issue":"3","key":"7199_CR13","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N Mladenovi\u0107","year":"2007","unstructured":"Mladenovi\u0107 N, Brimberg J, Hansen P, Moreno-P\u00e9rez JA (2007) The p-median problem: A survey of metaheuristic approaches. Eur J Oper Res 179(3):927\u2013939","journal-title":"Eur J Oper Res"},{"key":"7199_CR14","doi-asserted-by":"publisher","first-page":"104,647","DOI":"10.1016\/j.engappai.2021.104647","volume":"109","author":"MR Nakkala","year":"2022","unstructured":"Nakkala MR, Singh A, Rossi A (2022) Swarm intelligence, exact and matheuristic approaches for minimum weight directed dominating set problem. Eng Appl Artif Intell 109:104,647","journal-title":"Eng Appl Artif Intell"},{"issue":"19","key":"7199_CR15","doi-asserted-by":"publisher","first-page":"15643","DOI":"10.1007\/s00521-020-04898-4","volume":"32","author":"V Pandiri","year":"2020","unstructured":"Pandiri V, Singh A, Rossi A (2020) Two hybrid metaheuristic approaches for the covering salesman problem. Neural Comput Appl 32(19):15643\u201315663","journal-title":"Neural Comput Appl"},{"issue":"1","key":"7199_CR16","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.asoc.2012.07.009","volume":"13","author":"A Potluri","year":"2013","unstructured":"Potluri A, Singh A (2013) Hybrid metaheuristic algorithms for minimum weight dominating set. Appl Soft Comput 13(1):76\u201388","journal-title":"Appl Soft Comput"},{"key":"7199_CR17","doi-asserted-by":"publisher","first-page":"110,427","DOI":"10.1016\/j.compeleceng.2025.110427","volume":"125","author":"MD Rasheed","year":"2025","unstructured":"Rasheed MD, Singh A (2025) Solution of minimum general partial dominating set problem through heuristic approaches. Comput Electr Eng 125:110,427","journal-title":"Comput Electr Eng"},{"key":"7199_CR18","doi-asserted-by":"crossref","unstructured":"Rossi RA, Ahmed NK (2015) The network data repository with interactive graph analytics and visualization. In: AAAI. https:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"7199_CR19","doi-asserted-by":"crossref","unstructured":"Shmoys D, Tardos \u00c9, Aardal K (1997) Approximation algorithms for facility location problems. Universiteit Utrecht. UU-CS, Department of Computer Science. Utrecht University, Netherlands","DOI":"10.1145\/258533.258600"},{"issue":"2","key":"7199_CR20","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A Singh","year":"2009","unstructured":"Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9(2):625\u2013631","journal-title":"Appl Soft Comput"},{"key":"7199_CR21","doi-asserted-by":"publisher","first-page":"2247","DOI":"10.1007\/s10489-017-1075-0","volume":"48","author":"K Singh","year":"2018","unstructured":"Singh K, Sundar S (2018) Two new heuristics for the dominating tree problem. Appl Intell 48:2247\u20132267","journal-title":"Appl Intell"},{"key":"7199_CR22","unstructured":"Statistics Kingdom. Friedman test calculator. https:\/\/www.statskingdom.com\/friedman-calculator.html. Accessed: 20 Aug 2025"},{"key":"7199_CR23","doi-asserted-by":"publisher","first-page":"1458","DOI":"10.1109\/TNSE.2025.3596209","volume":"13","author":"L Zhang","year":"2026","unstructured":"Zhang L, Xu X, Ma K, Ge Y, Yang H (2026) An adaptive steering-vector-based evolutionary algorithm for influence maximization in social networks. IEEE Trans Netw Sci Eng 13:1458\u20131471","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"6","key":"7199_CR24","doi-asserted-by":"publisher","first-page":"2700","DOI":"10.1109\/TEVC.2024.3522012","volume":"29","author":"J Zhou","year":"2025","unstructured":"Zhou J, Zhang P (2025) An evolutionary algorithm based on cmsa for rooted max tree coverage. IEEE Trans Evol Comput 29(6):2700\u20132714","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-026-07199-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-026-07199-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-026-07199-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T10:48:42Z","timestamp":1779792522000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-026-07199-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["7199"],"URL":"https:\/\/doi.org\/10.1007\/s10489-026-07199-w","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"28 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2026","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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"219"}}