{"id":"https://openalex.org/W2762753353","doi":"https://doi.org/10.1145/3313904","title":"Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization","display_name":"Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization","publication_year":2019,"publication_date":"2019-04-02","ids":{"openalex":"https://openalex.org/W2762753353","doi":"https://doi.org/10.1145/3313904","mag":"2762753353"},"language":"en","primary_location":{"id":"doi:10.1145/3313904","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313904","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313904","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3313904","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Grant Schoenebeck","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Grant Schoenebeck","raw_affiliation_strings":["The University of Michigan, Ann Arbor, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":null,"display_name":"Biaoshuai Tao","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Biaoshuai Tao","raw_affiliation_strings":["The University of Michigan, Ann Arbor, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":1.0085,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.74902898,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"11","issue":"3","first_page":"1","last_page":"56"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.7692000269889832,"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.7692000269889832,"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/T11031","display_name":"Game Theory and Applications","score":0.053599998354911804,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12592","display_name":"Opinion Dynamics and Social Influence","score":0.047200001776218414,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.7421000003814697},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5673999786376953},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5174999833106995},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5088000297546387},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5019999742507935},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49880000948905945},{"id":"https://openalex.org/keywords/cascade","display_name":"Cascade","score":0.3269999921321869}],"concepts":[{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.7421000003814697},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5673999786376953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5626999735832214},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5174999833106995},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5088000297546387},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5019999742507935},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49880000948905945},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47620001435279846},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37860000133514404},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33219999074935913},{"id":"https://openalex.org/C34146451","wikidata":"https://www.wikidata.org/wiki/Q5048094","display_name":"Cascade","level":2,"score":0.3269999921321869},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3212999999523163},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.3206000030040741},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3174999952316284},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.2883000075817108},{"id":"https://openalex.org/C4727928","wikidata":"https://www.wikidata.org/wiki/Q17164759","display_name":"Social network (sociolinguistics)","level":3,"score":0.28760001063346863},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C189352744","wikidata":"https://www.wikidata.org/wiki/Q1971461","display_name":"Social choice theory","level":2,"score":0.2551000118255615}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3313904","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313904","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313904","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1710.02827","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1710.02827","pdf_url":"https://arxiv.org/pdf/1710.02827","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"}],"best_oa_location":{"id":"doi:10.1145/3313904","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313904","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313904","source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7786314253","display_name":null,"funder_award_id":"1452915,1535912","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7988200865","display_name":null,"funder_award_id":"1452915","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2762753353.pdf","grobid_xml":"https://content.openalex.org/works/W2762753353.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1654194294","https://openalex.org/W1680189815","https://openalex.org/W1971526329","https://openalex.org/W2004418786","https://openalex.org/W2005029869","https://openalex.org/W2041157860","https://openalex.org/W2042123098","https://openalex.org/W2056609785","https://openalex.org/W2058486861","https://openalex.org/W2061820396","https://openalex.org/W2102907934","https://openalex.org/W2105535951","https://openalex.org/W2108278206","https://openalex.org/W2108858998","https://openalex.org/W2114696370","https://openalex.org/W2124172444","https://openalex.org/W2128916364","https://openalex.org/W2129261459","https://openalex.org/W2132092465","https://openalex.org/W2145446394","https://openalex.org/W2150208547","https://openalex.org/W2157082398","https://openalex.org/W2187996512","https://openalex.org/W2272986348","https://openalex.org/W2432978112","https://openalex.org/W2797105966","https://openalex.org/W2963071749","https://openalex.org/W2964214140","https://openalex.org/W3020831476","https://openalex.org/W3121812901","https://openalex.org/W4238955406","https://openalex.org/W4243905823","https://openalex.org/W4253543067","https://openalex.org/W4298404569"],"related_works":[],"abstract_inverted_index":{"We":[0,134],"consider":[1],"the":[2,6,26,38,46,49,79,84,112,121,149,161,167,209,218],"problem":[3,29,50,152],"of":[4,8,19,59,109,120,148,169,182,220],"maximizing":[5],"spread":[7],"influence":[9,27,39,150,170,183,221],"in":[10,45,125,202],"a":[11,16,33,57,105,117,131,137,145,180],"social":[12,95],"network":[13,81,96],"by":[14,74,92],"choosing":[15],"fixed":[17,201],"number":[18],"initial":[20],"seeds,":[21],"formally":[22],"referred":[23],"to":[24,53,55,166],"as":[25],"maximization":[28,151],".":[30,43,62,191],"It":[31],"admits":[32],"(1\u22121/e)-factor":[34],"approximation":[35],"algorithm":[36,158],"if":[37],"function":[40],"is":[41,51,164,215],"submodular":[42],"Otherwise,":[44],"worst":[47],"case,":[48],"NP-hard":[52],"approximate":[54],"within":[56],"factor":[58],"N":[60],"1\u2212\u03b5":[61],"This":[63,204],"article":[64],"studies":[65],"whether":[66],"this":[67],"worst-case":[68],"hardness":[69],"result":[70,163,205],"can":[71],"be":[72],"circumvented":[73],"making":[75],"assumptions":[76,89],"about":[77],"either":[78],"underlying":[80],"topology":[82],"or":[83],"cascade":[85],"model.":[86],"All":[87],"our":[88],"are":[90,186],"motivated":[91],"many":[93],"real-life":[94],"cascades.":[97],"First,":[98],"we":[99,174],"present":[100,175],"strong":[101,176],"inapproximability":[102,162,177,193],"results":[103,178,194],"for":[104,179,197],"very":[106],"restricted":[107],"class":[108,181],"networks":[110],"called":[111,189],"(stochastic)":[113,123],"hierarchical":[114,154],"blockmodel":[115,124,155],",":[116],"special":[118],"case":[119],"well-studied":[122],"which":[126,142],"relationships":[127],"between":[128,171,211],"blocks":[129],"admit":[130],"tree":[132],"structure.":[133],"also":[135,206],"provide":[136],"dynamic-programming-based":[138],"polynomial":[139],"time":[140],"algorithm,":[141],"optimally":[143],"computes":[144],"directed":[146],"variant":[147],"on":[153],"networks.":[156],"Our":[157,192],"indicates":[159,207],"that":[160,185,208],"due":[165],"bidirectionality":[168],"agent-blocks.":[172],"Second,":[173],"functions":[184],"\u201calmost\u201d":[187],"submodular,":[188],"2-quasi-submodular":[190,199],"hold":[195],"even":[196],"any":[198],"f":[200],"advance.":[203],"\u201cthreshold\u201d":[210],"submodularity":[212],"and":[213],"nonsubmodularity":[214],"sharp,":[216],"regarding":[217],"approximability":[219],"maximization.":[222]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2017-10-20T00:00:00"}