{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T16:05:31Z","timestamp":1781021131473,"version":"3.54.1"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"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":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.asoc.2026.115474","type":"journal-article","created":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T00:27:24Z","timestamp":1778891244000},"page":"115474","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Heuristic approaches for solving the k-weighted dominating set problem"],"prefix":"10.1016","volume":"200","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-9856-7829","authenticated-orcid":false,"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":"78","reference":[{"key":"10.1016\/j.asoc.2026.115474_bib0005","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S1389-1286(01)00302-4","article-title":"Wireless sensor networks: a survey","volume":"38","author":"Akyildiz","year":"2002","journal-title":"Comput. Netw."},{"key":"10.1016\/j.asoc.2026.115474_bib0010","doi-asserted-by":"crossref","first-page":"5234","DOI":"10.1103\/PhysRevLett.85.5234","article-title":"Topology of evolving networks: local events and universality","volume":"85","author":"Albert","year":"2000","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/j.asoc.2026.115474_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2020.105157","article-title":"Exact and heuristic algorithms for the weighted total domination problem","volume":"127","author":"\u00c1lvarez-Miranda","year":"2021","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115474_bib0020","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1038\/nrg1272","article-title":"Network science: understanding the cell\u2019s functional organization","volume":"5","author":"Barab\u00e1si","year":"2004","journal-title":"Nat. Rev. Genet."},{"key":"10.1016\/j.asoc.2026.115474_bib0025","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.matcom.2024.09.010","article-title":"Finding the minimum k-weighted dominating sets using heuristic algorithms","volume":"228","author":"Barrena","year":"2025","journal-title":"Math. Comput. Simul."},{"key":"10.1016\/j.asoc.2026.115474_bib0030","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.matcom.2022.12.018","article-title":"An iterated greedy algorithm for finding the minimum dominating set in graphs","volume":"207","author":"Casado","year":"2023","journal-title":"Math. Comput. Simul."},{"key":"10.1016\/j.asoc.2026.115474_bib0035","series-title":"Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining","first-page":"1029","article-title":"Scalable influence maximization for prevalent viral marketing in large-scale social networks","author":"Chen","year":"2010"},{"key":"10.1016\/j.asoc.2026.115474_bib0040","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Gary","year":"1979"},{"key":"10.1016\/j.asoc.2026.115474_bib0045","series-title":"Foundations of Genetic Algorithms","first-page":"69","article-title":"A comparative analysis of selection schemes used in genetic algorithms","author":"Goldberg","year":"1991"},{"key":"10.1016\/j.asoc.2026.115474_bib0055","series-title":"Fundamentals of Domination in Graphs","author":"Haynes","year":"1998"},{"key":"10.1016\/j.asoc.2026.115474_bib0060","series-title":"Domination in Graphs: Advanced Topics","author":"Haynes","year":"1998"},{"key":"10.1016\/j.asoc.2026.115474_bib0065","series-title":"Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining","first-page":"137","article-title":"Maximizing the spread of influence through a social network","author":"Kempe","year":"2003"},{"key":"10.1016\/j.asoc.2026.115474_bib0070","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.asoc.2012.07.009","article-title":"Hybrid metaheuristic algorithms for minimum weight dominating set","volume":"13","author":"Potluri","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115474_bib0075","series-title":"International Conference on Applied Intelligence and Informatics","first-page":"82","article-title":"New heuristics for dominating tree problem","author":"Rasheed","year":"2024"},{"key":"10.1016\/j.asoc.2026.115474_bib0080","doi-asserted-by":"crossref","DOI":"10.1016\/j.compeleceng.2025.110427","article-title":"Solution of minimum general partial dominating set problem through heuristic approaches","volume":"125","author":"Rasheed","year":"2025","journal-title":"Comput. Electr. Eng."},{"key":"10.1016\/j.asoc.2026.115474_bib0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.compeleceng.2025.110222","article-title":"A swarm intelligence approach to minimum weight independent dominating set problem","volume":"123","author":"Rasheed","year":"2025","journal-title":"Comput. Electr. Eng."},{"key":"10.1016\/j.asoc.2026.115474_bib0090","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1016\/j.adhoc.2012.11.004","article-title":"A genetic algorithm based exact approach for lifetime maximization of directional sensor networks","volume":"11","author":"Singh","year":"2013","journal-title":"Ad Hoc Netw."},{"key":"10.1016\/j.asoc.2026.115474_bib0095","doi-asserted-by":"crossref","first-page":"2292","DOI":"10.1016\/j.comnet.2008.04.002","article-title":"Wireless sensor network survey","volume":"52","author":"Yick","year":"2008","journal-title":"Comput. Netw."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626009221?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626009221?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:54:47Z","timestamp":1781020487000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494626009221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":18,"alternative-id":["S1568494626009221"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115474","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Heuristic approaches for solving the -weighted dominating set problem","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115474","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115474"}}