{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:20:36Z","timestamp":1759335636162,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,4,24]],"date-time":"2022-04-24T00:00:00Z","timestamp":1650758400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,24]],"date-time":"2022-04-24T00:00:00Z","timestamp":1650758400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the Team Building Project for Graduate Tutors in Chongqing","award":["JDDSTD201802"],"award-info":[{"award-number":["JDDSTD201802"]}]},{"name":"Group Building Scientific Innovation Project for universities in Chongqing","award":["CXQT21021"],"award-info":[{"award-number":["CXQT21021"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-021-00834-x","type":"journal-article","created":{"date-parts":[[2022,4,24]],"date-time":"2022-04-24T08:02:36Z","timestamp":1650787356000},"page":"752-769","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A heuristic approximation algorithm of minimum dominating set based on rough set theory"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5174-2739","authenticated-orcid":false,"given":"Lihe","family":"Guan","sequence":"first","affiliation":[]},{"given":"Hong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,24]]},"reference":[{"key":"834_CR1","doi-asserted-by":"crossref","unstructured":"Adawiyah R, Agustin IH, Dafik, Slamin, Albirri ER (2018) Related wheel graphs and its locating edge domination number. In: Journal of Physics Conference Series 1022","DOI":"10.1088\/1742-6596\/1022\/1\/012007"},{"issue":"1","key":"834_CR2","first-page":"102023.1","volume":"97","author":"X Bai","year":"2020","unstructured":"Bai X, Zhao DN, Bai S, Wang Q, Li WL, Mu DM (2020) Minimum connected dominating sets in heterogeneous 3D wireless ad hoc networks. Ad Hoc Netw 97(1):102023.1-102023.11","journal-title":"Ad Hoc Netw"},{"key":"834_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.dam.2016.10.016","volume":"234","author":"N Boria","year":"2018","unstructured":"Boria N, Murat C, Paschos VT (2018) The probabilistic minimum dominating set problem. Discret Appl Math 234:93\u2013113","journal-title":"Discret Appl Math"},{"issue":"5","key":"834_CR4","doi-asserted-by":"publisher","first-page":"1938","DOI":"10.1007\/s00453-018-0519-1","volume":"81","author":"J Boyar","year":"2019","unstructured":"Boyar J, Eidenbenz SJ, Favrholdt LM, Kotrbcik M, Larsen KS (2019) Online dominating set. Algorithmica 81(5):1938\u20131964","journal-title":"Algorithmica"},{"issue":"8","key":"834_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.eswa.2016.02.012","volume":"55","author":"JT Cao","year":"2016","unstructured":"Cao JT, Song WY (2016) Risk assessment of co-creating value with customers: a rough group analytic network process approach. Expert Syst Appl 55(8):145\u2013156","journal-title":"Expert Syst Appl"},{"issue":"2","key":"834_CR6","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.ins.2015.09.054","volume":"330","author":"G Cattaneo","year":"2016","unstructured":"Cattaneo G, Chiaselotti G, Ciucci D, Gentile T (2016) On the connection of hypergraph theory with formal concept analysis and rough set theory. Inf Sci 330(2):342\u2013357","journal-title":"Inf Sci"},{"key":"834_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ins.2017.10.033","volume":"426","author":"D Chalupa","year":"2018","unstructured":"Chalupa D (2018) An order-based algorithm for minimum dominating set with application in graph mining. Inf Sci 426:101\u2013116","journal-title":"Inf Sci"},{"key":"834_CR8","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.asoc.2016.02.003","volume":"42","author":"JK Chen","year":"2016","unstructured":"Chen JK, Lin YJ, Li JJ, Lin GP, Ma ZM, Tan AH (2016) A rough set method for the minimum vertex cover problem of graphs. Appl Soft Comput 42:360\u2013367","journal-title":"Appl Soft Comput"},{"key":"834_CR9","doi-asserted-by":"publisher","first-page":"S12795","DOI":"10.1007\/s10586-018-1760-8","volume":"22","author":"A Chinnasamy","year":"2018","unstructured":"Chinnasamy A, Sivakumar B, Selvakumari P, Suresh A (2018) Minimum connected dominating set based RSU allocation for smart Cloud vehicles in VANET. Clust Comput 22:S12795\u2013S12804","journal-title":"Clust Comput"},{"issue":"3","key":"834_CR10","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10878-012-9530-7","volume":"27","author":"TN Dinh","year":"2014","unstructured":"Dinh TN, Shen YL, Nguyen DT, Thai MT (2014) On the approximability of positive influence dominating set in social networks. J Comb Optim 27(3):487\u2013503","journal-title":"J Comb Optim"},{"key":"834_CR11","volume-title":"Fundamentals of domination in graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs. Marcel Dekker, New York"},{"key":"834_CR12","unstructured":"Hjuler N, Italiano GF, Parotsidis N, Saulpic D (2019) Dominating sets and connected dominating sets in dynamic graphs. In: Proceedings of the 36th international symposium on theoretical aspects of computer science (STACS 2019), Editors: Niedermeier R and Paul C, pp 1\u201320"},{"key":"834_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.jpdc.2017.01.023","volume":"104","author":"RK Jallu","year":"2017","unstructured":"Jallu RK, Prasad PR, Das GK (2017) Distributed construction of connected dominating set in unit disk graphs. J Parallel Distrib Comput 104:159\u2013166","journal-title":"J Parallel Distrib Comput"},{"issue":"12","key":"834_CR14","doi-asserted-by":"publisher","first-page":"3391\u2013339","DOI":"10.3390\/a13120339","volume":"13","author":"J Li","year":"2020","unstructured":"Li J, Potru R, Shahrokhi F (2020a) A performance study of some approximation algorithms for computing a small dominating set in a Graph. Algorithms 13(12):3391\u2013339","journal-title":"Algorithms"},{"key":"834_CR15","first-page":"123340.1","volume":"541","author":"JW Li","year":"2020","unstructured":"Li JW, Wen XX, Wu MG, Liu F, Li SF (2020b) Identification of key nodes and vital edges in aviation network based on minimum connected dominating set. Phys A Stat Mech Appl 541:123340.1-123340.21","journal-title":"Phys A Stat Mech Appl"},{"issue":"3","key":"834_CR16","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/s00453-015-0095-6","volume":"77","author":"MC Lin","year":"2017","unstructured":"Lin MC, Mizrahi MJ, Szwarcfiter JL (2017) Exact algorithms for minimum weighted dominating induced matching. Algorithmica 77(3):642\u2013660","journal-title":"Algorithmica"},{"issue":"5","key":"834_CR17","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0020-0190(91)90021-9","volume":"39","author":"AK Parekh","year":"1991","unstructured":"Parekh AK (1991) Analysis of a greedy heuristic for finding small dominating sets in graphs. Inf Process Lett 39(5):237\u2013240","journal-title":"Inf Process Lett"},{"key":"834_CR18","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak Z (1982) Rough sets. Int J Inf Comput Sci 11:341\u2013356","journal-title":"Int J Inf Comput Sci"},{"issue":"2","key":"834_CR19","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10878-017-0197-y","volume":"35","author":"D Pradhan","year":"2018","unstructured":"Pradhan D, Jha A (2018) On computing a minimum secure dominating set in block graphs. J Comb Optim 35(2):613\u2013631","journal-title":"J Comb Optim"},{"issue":"1","key":"834_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-001-0101-z","volume":"33","author":"LA Sanchis","year":"2002","unstructured":"Sanchis LA (2002) Experimental analysis of heuristic algorithms for the dominating set problem. Algorithmica 33(1):3\u201318","journal-title":"Algorithmica"},{"issue":"2","key":"834_CR21","first-page":"331","volume":"15","author":"A Skowron","year":"1991","unstructured":"Skowron A, Rauszer C (1991) The discernibility matrices and functions in information systems. Fund Inform 15(2):331\u2013362","journal-title":"Fund Inform"},{"key":"834_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ipl.2019.02.002","volume":"147","author":"K Sukhamay","year":"2019","unstructured":"Sukhamay K (2019) Relationship between optimal k-distance dominating sets in a weighted graph and its spanning trees. Inf Process Lett 147:3\u20135","journal-title":"Inf Process Lett"},{"issue":"6","key":"834_CR23","first-page":"507","volume":"28","author":"AH Tan","year":"2015","unstructured":"Tan AH, Li JJ, Chen JK, Lin GP (2015) An attribute reduction method based on rough sets for dominating sets of graph. Pattern Recognit Artif Intell 28(6):507\u2013512","journal-title":"Pattern Recognit Artif Intell"},{"key":"834_CR24","doi-asserted-by":"crossref","unstructured":"Tan AH, Tao YZ, Wang C (2017) A rough-set based solution of the total domination problem. In: Polkowski L. et al. (eds) Rough Sets. IJCRS 2017. Lecture Notes in Computer Science, vol 10313. Springer, Cham, pp 131\u2013139","DOI":"10.1007\/978-3-319-60837-2_11"},{"issue":"17","key":"834_CR25","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1016\/j.dam.2011.07.001","volume":"159","author":"R Van","year":"2011","unstructured":"Van R, Johan MM, Bodlaender HL (2011) Exact algorithms for dominating set. Discret Appl Math 159(17):2147\u20132164","journal-title":"Discret Appl Math"},{"key":"834_CR26","first-page":"1","volume":"2013","author":"SP Wang","year":"2013","unstructured":"Wang SP, Zhu QX, Zhu W, Min F (2013) Equivalent characterizations of some graph problems by covering-based rough sets. J Appl Math 2013:1\u20137","journal-title":"J Appl Math"},{"key":"834_CR27","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.ins.2019.09.059","volume":"512","author":"YY Wang","year":"2020","unstructured":"Wang YY, Pan SW, Li CX, Yin MH (2020) A local search algorithm with reinforcement learning based repair procedure for minimum weight independent dominating set. Inf Sci 512:533\u2013548","journal-title":"Inf Sci"},{"issue":"4","key":"834_CR28","doi-asserted-by":"publisher","first-page":"2003","DOI":"10.3233\/IFS-151914","volume":"30","author":"QY Xu","year":"2016","unstructured":"Xu QY, Tan AH, Li JJ (2016) A rough set method for the vertex cover problem in graph theory. J Intell Fuzzy Syst 30(4):2003\u20132013","journal-title":"J Intell Fuzzy Syst"},{"issue":"1","key":"834_CR29","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.ijar.2019.12.001","volume":"118","author":"TH Xu","year":"2020","unstructured":"Xu TH, Wang GY, Yang J (2020) Finding strongly connected components of simple digraphs based on granulation strategy. Int J Approx Reason 118(1):64\u201378","journal-title":"Int J Approx Reason"},{"issue":"3","key":"834_CR30","first-page":"222","volume":"7","author":"FY Yuan","year":"2019","unstructured":"Yuan FY, Li CX, Gao X, Yin MH, Wang YY (2019) A novel hybrid algorithm for minimum total dominating set problem. Munich Personal RePEc Arch Pap 7(3):222\u2013232","journal-title":"Munich Personal RePEc Arch Pap"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00834-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00834-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00834-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:32:45Z","timestamp":1659079965000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00834-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,24]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["834"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00834-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,4,24]]},"assertion":[{"value":"5 November 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2022","order":2,"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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}