{"id":"https://openalex.org/W3134096386","doi":"https://doi.org/10.3390/a14030079","title":"An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks","display_name":"An Improved Greedy Heuristic for the Minimum Positive Influence Dominating Set Problem in Social Networks","publication_year":2021,"publication_date":"2021-02-28","ids":{"openalex":"https://openalex.org/W3134096386","doi":"https://doi.org/10.3390/a14030079","mag":"3134096386"},"language":"en","primary_location":{"id":"doi:10.3390/a14030079","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14030079","pdf_url":"https://www.mdpi.com/1999-4893/14/3/79/pdf?version=1616141039","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"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":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/3/79/pdf?version=1616141039","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055774416","display_name":"Salim Bouamama","orcid":"https://orcid.org/0000-0002-5842-2850"},"institutions":[{"id":"https://openalex.org/I40193446","display_name":"University Ferhat Abbas of Setif","ror":"https://ror.org/02rzqza52","country_code":"DZ","type":"education","lineage":["https://openalex.org/I40193446"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Salim Bouamama","raw_affiliation_strings":["Mechatronics Laboratory (LMETR)\u2014E1764200, Department of Computer Science, Ferhat Abbas University S\u00e9tif 1, S\u00e9tif 19000, Algeria"],"affiliations":[{"raw_affiliation_string":"Mechatronics Laboratory (LMETR)\u2014E1764200, Department of Computer Science, Ferhat Abbas University S\u00e9tif 1, S\u00e9tif 19000, Algeria","institution_ids":["https://openalex.org/I40193446"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051233439","display_name":"Christian Blum","orcid":"https://orcid.org/0000-0002-1736-3559"},"institutions":[{"id":"https://openalex.org/I4210131846","display_name":"Artificial Intelligence Research Institute","ror":"https://ror.org/03c0ach84","country_code":"ES","type":"facility","lineage":["https://openalex.org/I134820265","https://openalex.org/I4210131846"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Christian Blum","raw_affiliation_strings":["Artificial Intelligence Research Institute (IIIA-CSIC), Campus of the UAB, 08193 Bellaterra, Spain"],"affiliations":[{"raw_affiliation_string":"Artificial Intelligence Research Institute (IIIA-CSIC), Campus of the UAB, 08193 Bellaterra, Spain","institution_ids":["https://openalex.org/I4210131846"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051233439"],"corresponding_institution_ids":["https://openalex.org/I4210131846"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.9731,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.86496386,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"14","issue":"3","first_page":"79","last_page":"79"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9890000224113464,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9857000112533569,"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.7783327102661133},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7561134099960327},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7084529399871826},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6699806451797485},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.6378082036972046},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5479951500892639},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5372037887573242},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4885143041610718},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.4840230643749237},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.47256582975387573},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.47053155303001404},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4473317861557007},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31409433484077454},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2377990186214447},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0695040225982666}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7783327102661133},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7561134099960327},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7084529399871826},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6699806451797485},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.6378082036972046},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5479951500892639},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5372037887573242},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4885143041610718},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.4840230643749237},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.47256582975387573},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47053155303001404},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4473317861557007},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31409433484077454},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2377990186214447},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0695040225982666},{"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/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.3390/a14030079","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14030079","pdf_url":"https://www.mdpi.com/1999-4893/14/3/79/pdf?version=1616141039","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"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":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:digital.csic.es:10261/253028","is_oa":false,"landing_page_url":"http://hdl.handle.net/10261/253028","pdf_url":null,"source":{"id":"https://openalex.org/S4306400616","display_name":"DIGITAL.CSIC (Spanish National Research Council (CSIC))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I134820265","host_organization_name":"Consejo Superior de Investigaciones Cient\u00edficas","host_organization_lineage":["https://openalex.org/I134820265"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"art\u00edculo"},{"id":"pmh:oai:digital.csic.es:10261/253033","is_oa":true,"landing_page_url":"http://hdl.handle.net/10261/253033","pdf_url":null,"source":{"id":"https://openalex.org/S4306401639","display_name":"DIGITAL.CSIC (Spanish National Research Council (CSIC))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I134820265","host_organization_name":"Consejo Superior de Investigaciones Cient\u00edficas","host_organization_lineage":["https://openalex.org/I134820265"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"art\u00edculo"},{"id":"pmh:oai:doaj.org/article:d48440f773a84de7b36539bbeed96065","is_oa":true,"landing_page_url":"https://doaj.org/article/d48440f773a84de7b36539bbeed96065","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 3, p 79 (2021)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/14/3/79/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14030079","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 14; Issue 3; Pages: 79","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a14030079","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14030079","pdf_url":"https://www.mdpi.com/1999-4893/14/3/79/pdf?version=1616141039","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"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":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.46000000834465027,"id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G4313047161","display_name":null,"funder_award_id":"PID2019-104156GB-I00","funder_id":"https://openalex.org/F4320322930","funder_display_name":"Ministerio de Ciencia e Innovaci\u00f3n"}],"funders":[{"id":"https://openalex.org/F4320322930","display_name":"Ministerio de Ciencia e Innovaci\u00f3n","ror":"https://ror.org/034900433"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3134096386.pdf","grobid_xml":"https://content.openalex.org/works/W3134096386.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W102403294","https://openalex.org/W1567678169","https://openalex.org/W1971421925","https://openalex.org/W1984588599","https://openalex.org/W2004617458","https://openalex.org/W2013307517","https://openalex.org/W2039568841","https://openalex.org/W2059576833","https://openalex.org/W2090275183","https://openalex.org/W2094234423","https://openalex.org/W2116819994","https://openalex.org/W2158204848","https://openalex.org/W2169284845","https://openalex.org/W2191728435","https://openalex.org/W2294347342","https://openalex.org/W2328660157","https://openalex.org/W2524999369","https://openalex.org/W2594788739","https://openalex.org/W2755088640","https://openalex.org/W2783827472","https://openalex.org/W2792424561","https://openalex.org/W2917331228","https://openalex.org/W2976146672","https://openalex.org/W2983996856","https://openalex.org/W2990327145","https://openalex.org/W2993999219","https://openalex.org/W2997776631","https://openalex.org/W3035072211","https://openalex.org/W3043083509","https://openalex.org/W3100069540","https://openalex.org/W3101413764","https://openalex.org/W3112765143","https://openalex.org/W6727439462"],"related_works":["https://openalex.org/W2277088917","https://openalex.org/W4280543056","https://openalex.org/W2154172459","https://openalex.org/W26906372","https://openalex.org/W2541760731","https://openalex.org/W2018096104","https://openalex.org/W1827895227","https://openalex.org/W2373750984","https://openalex.org/W45904909","https://openalex.org/W1517981012"],"abstract_inverted_index":{"This":[0,28],"paper":[1],"presents":[2],"a":[3,10,43,72,110],"performance":[4,151],"comparison":[5],"of":[6,13,46,56,71,89,96,103,113,123,152,178],"greedy":[7,76,83,98,125,184],"heuristics":[8,84,99],"for":[9,78,157],"recent":[11],"variant":[12],"the":[14,20,54,60,69,79,94,101,120,132,143,150,170,176],"dominating":[15,24],"set":[16,25],"problem":[17,32,133],"known":[18],"as":[19],"minimum":[21],"positive":[22,57],"influence":[23,58],"(MPIDS)":[26],"problem.":[27],"APX-hard":[29],"combinatorial":[30],"optimization":[31],"has":[33],"applications":[34],"in":[35,50,59,175],"social":[36,114],"networks.":[37,172],"Its":[38],"aim":[39],"is":[40,154,186],"to":[41,52,169],"identify":[42],"small":[44,158,179],"subset":[45],"key":[47],"influential":[48],"individuals":[49],"order":[51],"facilitate":[53],"spread":[55],"whole":[61],"network.":[62],"In":[63],"this":[64],"paper,":[65],"we":[66,138],"focus":[67],"on":[68,109],"development":[70,95,102],"fast":[73],"and":[74,116,159,180],"effective":[75],"heuristic":[77],"MPIDS":[80],"problem,":[81],"because":[82],"are":[85],"an":[86],"essential":[87],"component":[88],"more":[90],"sophisticated":[91],"metaheuristics.":[92,105],"Thus,":[93],"well-working":[97],"supports":[100],"efficient":[104],"Extensive":[106],"experiments":[107],"conducted":[108],"wide":[111],"range":[112],"networks":[115,118],"complex":[117],"confirm":[119],"overall":[121],"superiority":[122],"our":[124,140,183],"algorithm":[126,141,185],"over":[127],"its":[128,164],"competitors,":[129],"especially":[130],"when":[131,166],"size":[134],"becomes":[135],"large.":[136],"Moreover,":[137],"compare":[139],"with":[142],"integer":[144],"linear":[145],"programming":[146],"solver":[147],"CPLEX.":[148,191],"While":[149],"CPLEX":[153],"very":[155],"strong":[156],"medium-sized":[160,181],"networks,":[161,182],"it":[162],"reaches":[163],"limits":[165],"being":[167],"applied":[168],"largest":[171],"However,":[173],"even":[174],"context":[177],"only":[187],"2.53%":[188],"worse":[189],"than":[190]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":5}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}