{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T00:17:56Z","timestamp":1783124276537,"version":"3.54.6"},"reference-count":44,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFC3341200"],"award-info":[{"award-number":["2023YFC3341200"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.cam.2026.117830","type":"journal-article","created":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T06:56:12Z","timestamp":1779864972000},"page":"117830","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["From integer programming to submodularity: A unified framework for several dominating problems"],"prefix":"10.1016","volume":"488","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8960-5521","authenticated-orcid":false,"given":"Hao","family":"Zhong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.cam.2026.117830_bib0001","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1504\/IJSNET.2013.053719","article-title":"Connected dominating set algorithms for wireless sensor networks","volume":"13","author":"Al-Nabhan","year":"2013","journal-title":"Int. J. Sens. Netw."},{"key":"10.1016\/j.cam.2026.117830_bib0002","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.adhoc.2016.02.003","article-title":"Construction of minimum connected dominating set in wireless sensor networks using pseudo dominating set","volume":"42","author":"Mohanty","year":"2016","journal-title":"Ad Hoc Netw."},{"key":"10.1016\/j.cam.2026.117830_bib0003","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.125797","article-title":"Replicating the performance of a portfolio of stocks using minimum dominating set","volume":"263","author":"Biswas","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cam.2026.117830_bib0004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s40649-020-00078-5","article-title":"Solving the k-dominating set problem on very large-scale networks","volume":"7","author":"Nguyen","year":"2020","journal-title":"Comput. Soc. Netw."},{"key":"10.1016\/j.cam.2026.117830_bib0005","series-title":"Proceedings of the 26th Modern AI and Cognitive Science Conference 2015, Greensboro, NC, USA, April 25\u201326, 2015","first-page":"55","article-title":"Fast dominating set algorithms for social networks","author":"Campan","year":"2015"},{"issue":"1","key":"10.1016\/j.cam.2026.117830_bib0006","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.disc.2007.12.044","article-title":"A survey of selected recent results on total domination in graphs","volume":"309","author":"Henning","year":"2009","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.cam.2026.117830_bib0007","doi-asserted-by":"crossref","first-page":"563","DOI":"10.7151\/dmgt.1514","article-title":"Partitioning a graph into a dominating set, a total dominating set, and something else","volume":"30","author":"Henning","year":"2010","journal-title":"Discuss. Math. Graph Theory"},{"issue":"3","key":"10.1016\/j.cam.2026.117830_bib0008","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.tcs.2009.10.001","article-title":"On positive influence dominating sets in social networks","volume":"412","author":"Wang","year":"2011","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.cam.2026.117830_bib0009","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1007\/s10898-009-9511-2","article-title":"New dominating sets in social networks","volume":"48","author":"Zhu","year":"2010","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.cam.2026.117830_bib0010","series-title":"Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21\u201323, 2007. Revised Papers","first-page":"1","article-title":"Computational complexity of generalized domination: a complete dichotomy for chordal graphs","author":"Golovach","year":"2007"},{"key":"10.1016\/j.cam.2026.117830_bib0011","series-title":"The Design of Approximation Algorithms","author":"Williamson","year":"2011"},{"key":"10.1016\/j.cam.2026.117830_bib0012","series-title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI 2024","first-page":"7056","article-title":"Exactly solving minimum dominating set and its generalization","author":"Xiong","year":"2024"},{"key":"10.1016\/j.cam.2026.117830_bib0013","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.amc.2019.04.038","article-title":"Integer linear programming models for the weighted total domination problem","volume":"358","author":"Ma","year":"2019","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"10.1016\/j.cam.2026.117830_bib0014","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1287\/ijoc.2013.0589","article-title":"Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem","volume":"26","author":"Gendron","year":"2014","journal-title":"INFORMS J. Comput."},{"issue":"01","key":"10.1016\/j.cam.2026.117830_bib0015","doi-asserted-by":"crossref","DOI":"10.1142\/S1793830920500962","article-title":"Linear programming approach for various domination parameters","volume":"13","author":"Duraisamy","year":"2021","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"3","key":"10.1016\/j.cam.2026.117830_bib0016","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","article-title":"A greedy heuristic for the set-covering problem","volume":"4","author":"Chvatal","year":"1979","journal-title":"Math. Oper. Res."},{"issue":"1","key":"10.1016\/j.cam.2026.117830_bib0017","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","article-title":"An analysis of approximations for maximizing submodular set functions\u2014I","volume":"14","author":"Nemhauser","year":"1978","journal-title":"Math. Program."},{"key":"10.1016\/j.cam.2026.117830_bib0018","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.114069","article-title":"A unified greedy approximation for several dominating set problems","volume":"973","author":"Zhong","year":"2023","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"10.1016\/j.cam.2026.117830_bib0019","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TEVC.2016.2538819","article-title":"An effective hybrid memetic algorithm for the minimum weight dominating set problem","volume":"20","author":"Lin","year":"2016","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cam.2026.117830_bib0020","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."},{"issue":"2","key":"10.1016\/j.cam.2026.117830_bib0021","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1287\/ijoc.2021.1106","article-title":"A fast vertex weighting-based local search for finding minimum connected dominating sets","volume":"34","author":"Wu","year":"2022","journal-title":"Inf. J. Comput."},{"key":"10.1016\/j.cam.2026.117830_bib0022","series-title":"Handbook of Approximation Algorithms and Metaheuristics","first-page":"753","article-title":"Submodular functions maximization problems","volume":"1","author":"Buchbinder","year":"2018"},{"key":"10.1016\/j.cam.2026.117830_bib0023","series-title":"Introduction to Combinatorial Optimization","first-page":"293","article-title":"Greedy approximation and submodular optimization","author":"Du","year":"2022"},{"issue":"5","key":"10.1016\/j.cam.2026.117830_bib0024","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/s10878-024-01175-1","article-title":"A novel local search approach with connected dominating degree-based incremental neighborhood evaluation for the minimum 2-connected dominating set problem","volume":"47","author":"Luo","year":"2024","journal-title":"J. Comb. Optim."},{"issue":"4","key":"10.1016\/j.cam.2026.117830_bib0025","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10878-010-9357-z","article-title":"A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs","volume":"23","author":"Zhu","year":"2012","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.cam.2026.117830_bib0026","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."},{"issue":"4","key":"10.1016\/j.cam.2026.117830_bib0027","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10878-024-01229-4","article-title":"On greedy approximation algorithm for the minimum resolving dominating set problem","volume":"48","author":"Zhong","year":"2024","journal-title":"J. Comb. Optim."},{"issue":"4","key":"10.1016\/j.cam.2026.117830_bib0028","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/s10878-024-01124-y","article-title":"Approximation algorithm for the minimum partial connected Roman dominating set problem","volume":"47","author":"Zhang","year":"2024","journal-title":"J. Comb. Optim."},{"issue":"3","key":"10.1016\/j.cam.2026.117830_bib0029","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3390\/axioms15030191","article-title":"Efficient minus and signed domination in proper interval graphs with a totally unimodular structure","volume":"15","author":"Lee","year":"2026","journal-title":"Axioms"},{"issue":"1","key":"10.1016\/j.cam.2026.117830_bib0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10878-021-00812-3","article-title":"A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks","volume":"44","author":"Chen","year":"2022","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.cam.2026.117830_bib0031","series-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2025","first-page":"77","article-title":"Local constant approximation for dominating set on graphs excluding large minors","author":"Bonamy","year":"2025"},{"issue":"1","key":"10.1016\/j.cam.2026.117830_bib0032","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1137\/18M1212094","article-title":"Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems","volume":"34","author":"Khuller","year":"2020","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"10.1016\/j.cam.2026.117830_bib0033","doi-asserted-by":"crossref","first-page":"1452","DOI":"10.1093\/comjnl\/bxac021","article-title":"A self-stabilizing distributed algorithm for the generalized dominating set problem with safe convergence","volume":"66","author":"Kobayashi","year":"2023","journal-title":"Comput. J."},{"key":"10.1016\/j.cam.2026.117830_bib0034","series-title":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018","first-page":"309","article-title":"Randomized greedy algorithms for covering problems","author":"Gao","year":"2018"},{"key":"10.1016\/j.cam.2026.117830_bib0035","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."},{"issue":"12","key":"10.1016\/j.cam.2026.117830_bib0036","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.cam.2026.117830_bib0037","series-title":"Combinatorial Optimization: Theory and Algorithms","author":"Korte","year":"2008"},{"key":"10.1016\/j.cam.2026.117830_bib0038","series-title":"Combinatorial Optimization: Packing and Covering","author":"Cornu\u00e9jols","year":"2001"},{"issue":"3","key":"10.1016\/j.cam.2026.117830_bib0039","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1016\/j.ejor.2017.08.044","article-title":"The weighted independent domination problem: integer linear programming models and metaheuristic approaches","volume":"265","author":"Davidson","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cam.2026.117830_bib0040","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/j.asoc.2018.06.052","article-title":"An efficient matheuristic for the minimum-weight dominating set problem","volume":"72","author":"Albuquerque","year":"2018","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"10.1016\/j.cam.2026.117830_bib0041","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1016\/j.ejor.2023.08.033","article-title":"Exact and heuristic algorithms for the domination problem","volume":"313","author":"Inza","year":"2024","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cam.2026.117830_bib0042","unstructured":"L. Dijkstra, A. Gagarin, V. Zverovich, Weighted domination models and randomized heuristics, (2022). arXiv: 2203.00799."},{"issue":"7","key":"10.1016\/j.cam.2026.117830_bib0043","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1007\/s11590-016-1007-7","article-title":"Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs","volume":"10","author":"Zhang","year":"2016","journal-title":"Optim. Lett."},{"issue":"9","key":"10.1016\/j.cam.2026.117830_bib0044","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1016\/j.dam.2010.01.009","article-title":"k-tuple total domination in graphs","volume":"158","author":"Henning","year":"2010","journal-title":"Discrete Appl. Math."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004723?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004723?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T23:38:10Z","timestamp":1783121890000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726004723"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":44,"alternative-id":["S0377042726004723"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117830","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"From integer programming to submodularity: A unified framework for several dominating problems","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2026.117830","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":"117830"}}