{"id":"https://openalex.org/W4378086907","doi":"https://doi.org/10.3390/axioms12060506","title":"An Approximation Algorithm for a Variant of Dominating Set Problem","display_name":"An Approximation Algorithm for a Variant of Dominating Set Problem","publication_year":2023,"publication_date":"2023-05-23","ids":{"openalex":"https://openalex.org/W4378086907","doi":"https://doi.org/10.3390/axioms12060506"},"language":"en","primary_location":{"id":"doi:10.3390/axioms12060506","is_oa":true,"landing_page_url":"https://doi.org/10.3390/axioms12060506","pdf_url":"https://www.mdpi.com/2075-1680/12/6/506/pdf?version=1687157287","source":{"id":"https://openalex.org/S4210173132","display_name":"Axioms","issn_l":"2075-1680","issn":["2075-1680"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Axioms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/2075-1680/12/6/506/pdf?version=1687157287","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100436505","display_name":"Limin Wang","orcid":"https://orcid.org/0000-0002-3674-7718"},"institutions":[{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Limin Wang","raw_affiliation_strings":["State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100759564","display_name":"Wenqi Wang","orcid":"https://orcid.org/0000-0002-2153-7339"},"institutions":[{"id":"https://openalex.org/I152031979","display_name":"Nanjing Normal University","ror":"https://ror.org/036trcv74","country_code":"CN","type":"education","lineage":["https://openalex.org/I152031979"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenqi Wang","raw_affiliation_strings":["School of Mathematical Science & Institute of Mathematics, Nanjing Normal University, Nanjing 210023, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical Science & Institute of Mathematics, Nanjing Normal University, Nanjing 210023, China","institution_ids":["https://openalex.org/I152031979"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100436505"],"corresponding_institution_ids":["https://openalex.org/I881766915"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1782},"fwci":0.2665,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.54282282,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"12","issue":"6","first_page":"506","last_page":"506"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.8516298532485962},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7145992517471313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6768633723258972},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5993775129318237},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5949153304100037},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.553043782711029},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5426022410392761},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5311086773872375},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5225643515586853},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.4906731843948364},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4823314845561981},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.45236700773239136},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4412469267845154},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4383953809738159},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43252119421958923},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4021417200565338},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1821552813053131},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.11849462985992432},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06854555010795593}],"concepts":[{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.8516298532485962},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7145992517471313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6768633723258972},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5993775129318237},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5949153304100037},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.553043782711029},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5426022410392761},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5311086773872375},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5225643515586853},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4906731843948364},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4823314845561981},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.45236700773239136},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4412469267845154},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4383953809738159},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43252119421958923},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4021417200565338},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1821552813053131},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.11849462985992432},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06854555010795593},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/axioms12060506","is_oa":true,"landing_page_url":"https://doi.org/10.3390/axioms12060506","pdf_url":"https://www.mdpi.com/2075-1680/12/6/506/pdf?version=1687157287","source":{"id":"https://openalex.org/S4210173132","display_name":"Axioms","issn_l":"2075-1680","issn":["2075-1680"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Axioms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:a23f39ca60df4a30ae10184619804d72","is_oa":true,"landing_page_url":"https://doaj.org/article/a23f39ca60df4a30ae10184619804d72","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Axioms, Vol 12, Iss 6, p 506 (2023)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/axioms12060506","is_oa":true,"landing_page_url":"https://doi.org/10.3390/axioms12060506","pdf_url":"https://www.mdpi.com/2075-1680/12/6/506/pdf?version=1687157287","source":{"id":"https://openalex.org/S4210173132","display_name":"Axioms","issn_l":"2075-1680","issn":["2075-1680"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Axioms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2379088649","display_name":null,"funder_award_id":"62272215","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4378086907.pdf"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W560340026","https://openalex.org/W1493071618","https://openalex.org/W1987967894","https://openalex.org/W1996066664","https://openalex.org/W2000760879","https://openalex.org/W2003370404","https://openalex.org/W2006503776","https://openalex.org/W2007607373","https://openalex.org/W2023728975","https://openalex.org/W2040579873","https://openalex.org/W2057795228","https://openalex.org/W2066561381","https://openalex.org/W2071852002","https://openalex.org/W2076327726","https://openalex.org/W2094067618","https://openalex.org/W2098502330","https://openalex.org/W2100961486","https://openalex.org/W2105432809","https://openalex.org/W2108167170","https://openalex.org/W2141116886","https://openalex.org/W2151757686","https://openalex.org/W2159579504","https://openalex.org/W2298233813","https://openalex.org/W2694808592","https://openalex.org/W2917331228","https://openalex.org/W3041620247","https://openalex.org/W3083234306","https://openalex.org/W3088062940","https://openalex.org/W3141863997","https://openalex.org/W3156539362","https://openalex.org/W3202989673","https://openalex.org/W4214483257","https://openalex.org/W4248338579","https://openalex.org/W6802257909"],"related_works":["https://openalex.org/W2952723382","https://openalex.org/W4301177232","https://openalex.org/W2155984879","https://openalex.org/W1483891445","https://openalex.org/W2388345276","https://openalex.org/W2391238671","https://openalex.org/W1530712874","https://openalex.org/W3047117384","https://openalex.org/W4242849573","https://openalex.org/W2893517329"],"abstract_inverted_index":{"In":[0],"this":[1,52,90,110],"paper,":[2],"we":[3],"consider":[4],"a":[5,22,29,55,72,95,120],"variant":[6],"of":[7,24,85,104,109,119],"dominating":[8,14,31,62,75],"set":[9,15,32,63,76],"problem,":[10,91],"i.e.,":[11],"the":[12,60,83,86,101,117],"total":[13,30,61,74],"problem.":[16],"Given":[17],"an":[18],"undirected":[19],"graph":[20],"G=(V,E),":[21],"subset":[23],"vertices":[25],"T\u2286V":[26],"is":[27,38,94,100,112],"called":[28],"if":[33],"every":[34],"vertex":[35,44],"in":[36,45,65],"V":[37],"adjacent":[39],"to":[40,89],"at":[41,79],"least":[42],"one":[43],"T.":[46],"Based":[47],"on":[48],"LP":[49],"relaxation":[50],"techniques,":[51],"paper":[53],"gives":[54],"distributed":[56],"approximation":[57],"algorithm":[58,70,111],"for":[59],"problem":[64],"general":[66],"graphs.":[67],"The":[68,106],"presented":[69],"obtains":[71],"fractional":[73],"that":[77],"is,":[78],"most,":[80],"k(1+\u03941k)\u03941k":[81],"times":[82],"size":[84],"optimal":[87],"solution":[88],"where":[92],"k":[93],"positive":[96],"integer":[97],"and":[98],"\u0394":[99],"maximum":[102],"degree":[103],"G.":[105],"running":[107],"time":[108],"constant":[113],"communication":[114,122],"rounds":[115],"under":[116],"assumption":[118],"synchronous":[121],"model.":[123]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}