{"id":"https://openalex.org/W2095494083","doi":"https://doi.org/10.1109/glocom.2011.6133985","title":"The Probabilistic Maximum Coverage Problem in Social Networks","display_name":"The Probabilistic Maximum Coverage Problem in Social Networks","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W2095494083","doi":"https://doi.org/10.1109/glocom.2011.6133985","mag":"2095494083"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2011.6133985","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2011.6133985","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","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/A5057071672","display_name":"Xiaoguang Fan","orcid":"https://orcid.org/0000-0002-1324-3138"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Xiaoguang Fan","raw_affiliation_strings":["University of Hong Kong, Pokfulam, Hong Kong, China","University of Hong Kong; Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hong Kong, Pokfulam, Hong Kong, China","institution_ids":["https://openalex.org/I889458895"]},{"raw_affiliation_string":"University of Hong Kong; Hong Kong, China","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030762643","display_name":"V. O. K. Li","orcid":null},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"V. O. K. Li","raw_affiliation_strings":["University of Hong Kong, Pokfulam, Hong Kong, China","University of Hong Kong; Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hong Kong, Pokfulam, Hong Kong, China","institution_ids":["https://openalex.org/I889458895"]},{"raw_affiliation_string":"University of Hong Kong; Hong Kong, China","institution_ids":["https://openalex.org/I889458895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I889458895"],"apc_list":null,"apc_paid":null,"fwci":0.7069,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.72491359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"20","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9998000264167786,"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.9998000264167786,"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/T12592","display_name":"Opinion Dynamics and Social Influence","score":0.9994000196456909,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9732000231742859,"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.8026052713394165},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.7935585975646973},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7372822761535645},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.686235785484314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6625184416770935},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.593052864074707},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43294936418533325},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41240930557250977},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24398687481880188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23178109526634216}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.8026052713394165},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.7935585975646973},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7372822761535645},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.686235785484314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6625184416770935},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.593052864074707},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43294936418533325},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41240930557250977},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24398687481880188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23178109526634216},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/glocom.2011.6133985","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2011.6133985","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","raw_type":"proceedings-article"},{"id":"pmh:oai:hub.hku.hk:10722/158776","is_oa":false,"landing_page_url":"http://hdl.handle.net/10722/158776","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference_Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4099999964237213}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322170","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W950821216","https://openalex.org/W1586505959","https://openalex.org/W1654194294","https://openalex.org/W1975330620","https://openalex.org/W1981721526","https://openalex.org/W1994473607","https://openalex.org/W2002055996","https://openalex.org/W2041157860","https://openalex.org/W2042123098","https://openalex.org/W2056609785","https://openalex.org/W2061820396","https://openalex.org/W2061901927","https://openalex.org/W2080379754","https://openalex.org/W2107559689","https://openalex.org/W2108614537","https://openalex.org/W2114720692","https://openalex.org/W2157067735","https://openalex.org/W2187996512","https://openalex.org/W2611804663","https://openalex.org/W4250886557","https://openalex.org/W6683141024"],"related_works":["https://openalex.org/W1827895227","https://openalex.org/W4285104409","https://openalex.org/W4210317843","https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W2163115662","https://openalex.org/W189401716","https://openalex.org/W2898570308","https://openalex.org/W2019216770"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,17],"consider":[4],"the":[5,40,45,56,83,87,91,99],"problem":[6],"of":[7],"maximizing":[8],"information":[9],"propagation":[10],"in":[11],"social":[12],"networks.":[13,68],"To":[14],"solve":[15],"it,":[16],"introduce":[18],"a":[19,27,31],"probabilistic":[20],"maximum":[21],"coverage":[22],"problem,":[23],"and":[24,30,44,60,80],"further":[25],"purpose":[26],"cluster-based":[28],"heuristic":[29,33],"neighborhood-removal":[32],"for":[34],"two":[35],"basic":[36],"diffusion":[37],"models,":[38],"namely,":[39],"Linear":[41],"Threshold":[42],"Model":[43],"Independent":[46],"Cascade":[47],"Model,":[48],"respectively.":[49],"Our":[50],"proposed":[51,73],"strategies":[52],"are":[53],"compared":[54,97],"with":[55,98],"pure":[57],"greedy":[58,88,100],"algorithm":[59],"centrality-based":[61,78],"schemes":[62,79],"via":[63],"experiments":[64],"on":[65],"large":[66],"collaboration":[67],"We":[69],"find":[70],"that":[71],"our":[72],"algorithms":[74],"perform":[75],"better":[76],"than":[77],"achieve":[81],"approximately":[82],"same":[84],"performance":[85],"as":[86],"algorithm.":[89],"Moreover,":[90],"computational":[92],"load":[93],"is":[94],"significantly":[95],"reduced":[96],"heuristic.":[101]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}