{"id":"https://openalex.org/W3204684126","doi":"https://doi.org/10.1007/s10878-021-00812-3","title":"A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks","display_name":"A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks","publication_year":2021,"publication_date":"2021-10-06","ids":{"openalex":"https://openalex.org/W3204684126","doi":"https://doi.org/10.1007/s10878-021-00812-3","mag":"3204684126"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-021-00812-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-021-00812-3","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100357376","display_name":"Weidong Chen","orcid":"https://orcid.org/0000-0001-8757-0679"},"institutions":[{"id":"https://openalex.org/I187400657","display_name":"South China Normal University","ror":"https://ror.org/01kq0pv72","country_code":"CN","type":"education","lineage":["https://openalex.org/I187400657"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Weidong Chen","raw_affiliation_strings":["School of Computer Science, South China Normal University, Guangzhou, 510631, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, South China Normal University, Guangzhou, 510631, China","institution_ids":["https://openalex.org/I187400657"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023876926","display_name":"Hao Zhong","orcid":"https://orcid.org/0000-0001-8960-5521"},"institutions":[{"id":"https://openalex.org/I187400657","display_name":"South China Normal University","ror":"https://ror.org/01kq0pv72","country_code":"CN","type":"education","lineage":["https://openalex.org/I187400657"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hao Zhong","raw_affiliation_strings":["School of Computer Science, South China Normal University, Guangzhou, 510631, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, South China Normal University, Guangzhou, 510631, China","institution_ids":["https://openalex.org/I187400657"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073970841","display_name":"Lidong Wu","orcid":"https://orcid.org/0000-0001-5714-1398"},"institutions":[{"id":"https://openalex.org/I221716585","display_name":"The University of Texas at Tyler","ror":"https://ror.org/01azfw069","country_code":"US","type":"education","lineage":["https://openalex.org/I221716585"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lidong Wu","raw_affiliation_strings":["Department of Computer Science, University of Texas at Tyler, Tyler, TX, 75799, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Tyler, Tyler, TX, 75799, USA","institution_ids":["https://openalex.org/I221716585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037860988","display_name":"Ding\u2010Zhu Du","orcid":"https://orcid.org/0000-0002-7345-2185"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ding-Zhu Du","raw_affiliation_strings":["Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75083, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at Dallas, Richardson, TX, 75083, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100357376"],"corresponding_institution_ids":["https://openalex.org/I187400657"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.9088,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.78862015,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"44","issue":"1","first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9860000014305115,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9456428289413452},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.8090960383415222},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7776647806167603},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7625159025192261},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.538496196269989},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.49792051315307617},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.46084073185920715},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4581034183502197},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4538584351539612},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.45162856578826904},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.444527804851532},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43587878346443176},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4164758324623108},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4104922413825989},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37256497144699097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3580625653266907},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3223549425601959}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9456428289413452},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.8090960383415222},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7776647806167603},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7625159025192261},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.538496196269989},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.49792051315307617},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.46084073185920715},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4581034183502197},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4538584351539612},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.45162856578826904},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.444527804851532},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43587878346443176},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4164758324623108},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4104922413825989},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37256497144699097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3580625653266907},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3223549425601959},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-021-00812-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-021-00812-3","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:44:y:2022:i:1:d:10.1007_s10878-021-00812-3","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-021-00812-3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W180637186","https://openalex.org/W603975761","https://openalex.org/W1502199009","https://openalex.org/W1551866658","https://openalex.org/W1567678169","https://openalex.org/W1984588599","https://openalex.org/W1984921594","https://openalex.org/W2029828838","https://openalex.org/W2059576833","https://openalex.org/W2069808479","https://openalex.org/W2074008775","https://openalex.org/W2076189040","https://openalex.org/W2076242723","https://openalex.org/W2155461593","https://openalex.org/W2738706874","https://openalex.org/W2792424561","https://openalex.org/W2865235865","https://openalex.org/W2975966238","https://openalex.org/W2976146672","https://openalex.org/W2976859544","https://openalex.org/W2983996856","https://openalex.org/W3094504436"],"related_works":["https://openalex.org/W2944744777","https://openalex.org/W4321600307","https://openalex.org/W4251076636","https://openalex.org/W3047700137","https://openalex.org/W2962866360","https://openalex.org/W2950850544","https://openalex.org/W2950365512","https://openalex.org/W1497312391","https://openalex.org/W1608444752","https://openalex.org/W1621774961"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-22T08:38:42.863108","created_date":"2025-10-10T00:00:00"}