{"id":"https://openalex.org/W2976146672","doi":"https://doi.org/10.1109/infcomw.2019.8845129","title":"A Fast Greedy Algorithm for Finding Minimum Positive Influence Dominating Sets in Social Networks","display_name":"A Fast Greedy Algorithm for Finding Minimum Positive Influence Dominating Sets in Social Networks","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2976146672","doi":"https://doi.org/10.1109/infcomw.2019.8845129","mag":"2976146672"},"language":"en","primary_location":{"id":"doi:10.1109/infcomw.2019.8845129","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcomw.2019.8845129","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"proceedings-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/A5045809174","display_name":"Jiehui Pan","orcid":null},"institutions":[{"id":"https://openalex.org/I66867065","display_name":"East China Normal University","ror":"https://ror.org/02n96ep67","country_code":"CN","type":"education","lineage":["https://openalex.org/I66867065"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jiehui Pan","raw_affiliation_strings":["School of Computer Science and Software Engineering, East China Normal University, Shanghai, PR China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering, East China Normal University, Shanghai, PR China","institution_ids":["https://openalex.org/I66867065"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021918214","display_name":"Tian-Ming Bu","orcid":"https://orcid.org/0000-0002-4793-7023"},"institutions":[{"id":"https://openalex.org/I66867065","display_name":"East China Normal University","ror":"https://ror.org/02n96ep67","country_code":"CN","type":"education","lineage":["https://openalex.org/I66867065"]},{"id":"https://openalex.org/I4210139618","display_name":"Shanghai Key Laboratory of Trustworthy Computing","ror":"https://ror.org/030qbr085","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210139618"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tian-Ming Bu","raw_affiliation_strings":["Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, PR China"],"affiliations":[{"raw_affiliation_string":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, PR China","institution_ids":["https://openalex.org/I4210139618","https://openalex.org/I66867065"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045809174"],"corresponding_institution_ids":["https://openalex.org/I66867065"],"apc_list":null,"apc_paid":null,"fwci":1.1121,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.80605198,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"360","last_page":"364"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9948999881744385,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9948999881744385,"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/T11478","display_name":"Caching and Content Delivery","score":0.9941999912261963,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9937999844551086,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7895752191543579},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.7817298769950867},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6117908954620361},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5937787890434265},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5460302233695984},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5444222688674927},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5438554286956787},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5056517124176025},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4986863136291504},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.41583842039108276},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33790087699890137},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32954004406929016},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.27320611476898193}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7895752191543579},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.7817298769950867},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6117908954620361},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5937787890434265},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5460302233695984},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5444222688674927},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5438554286956787},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5056517124176025},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4986863136291504},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.41583842039108276},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33790087699890137},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32954004406929016},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27320611476898193},{"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/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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcomw.2019.8845129","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcomw.2019.8845129","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1567678169","https://openalex.org/W1984588599","https://openalex.org/W2059576833","https://openalex.org/W2069808479","https://openalex.org/W2076189040","https://openalex.org/W2294347342","https://openalex.org/W2738706874","https://openalex.org/W2755088640","https://openalex.org/W2792424561","https://openalex.org/W2865235865"],"related_works":["https://openalex.org/W3204684126","https://openalex.org/W2007607373","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W2045237525","https://openalex.org/W189401716","https://openalex.org/W2898570308","https://openalex.org/W2019216770","https://openalex.org/W2574250816","https://openalex.org/W2544904580"],"abstract_inverted_index":{"As":[0],"a":[1,17,54],"variant":[2],"of":[3,25,77,112],"the":[4,8,29,60,72,75,78,82,91,99,103],"dominating":[5,11],"set":[6,12,18],"problem,":[7],"positive":[9],"influence":[10],"problem":[13,37],"tries":[14],"to":[15,58,86],"find":[16],"such":[19],"that":[20,69],"at":[21],"least":[22],"half":[23],"neighbors":[24],"every":[26],"node":[27],"in":[28,41],"graph":[30],"are":[31],"included":[32],"by":[33,81,109],"it.":[34],"Because":[35],"this":[36],"has":[38,45],"wide":[39],"applications":[40],"social":[42],"networks,":[43],"it":[44],"received":[46],"more":[47,49],"and":[48],"attention.":[50],"This":[51],"paper":[52],"presents":[53],"fast":[55],"greedy":[56],"algorithm":[57,83],"solve":[59],"problem.":[61],"Sufficient":[62],"experiments":[63],"on":[64],"typical":[65],"real":[66],"networks":[67],"show":[68],"compared":[70],"with":[71],"existing":[73],"algorithms,":[74],"quality":[76],"solutions":[79],"obtained":[80],"is":[84,94],"close":[85],"or":[87],"even":[88],"better,":[89],"while":[90],"running":[92,104],"time":[93,105],"greatly":[95],"reduced.":[96],"Especially,":[97],"when":[98],"network":[100],"becomes":[101],"larger,":[102],"can":[106],"be":[107],"reduced":[108],"several":[110],"orders":[111],"magnitude.":[113]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}