{"id":"https://openalex.org/W2944325705","doi":"https://doi.org/10.1145/3292500.3330911","title":"Adversarially Robust Submodular Maximization under Knapsack Constraints","display_name":"Adversarially Robust Submodular Maximization under Knapsack Constraints","publication_year":2019,"publication_date":"2019-07-25","ids":{"openalex":"https://openalex.org/W2944325705","doi":"https://doi.org/10.1145/3292500.3330911","mag":"2944325705"},"language":"en","primary_location":{"id":"doi:10.1145/3292500.3330911","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3292500.3330911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","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/A5091510008","display_name":"Dmitrii Avdiukhin","orcid":null},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dmitrii Avdiukhin","raw_affiliation_strings":["Indiana University, Bloomington, IN, USA"],"affiliations":[{"raw_affiliation_string":"Indiana University, Bloomington, IN, USA","institution_ids":["https://openalex.org/I4210119109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021154381","display_name":"Slobodan Mitrovi\u0107","orcid":"https://orcid.org/0000-0002-8571-0970"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Slobodan Mitrovi\u0107","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001984674","display_name":"Grigory Yaroslavtsev","orcid":null},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Grigory Yaroslavtsev","raw_affiliation_strings":["Indiana University & The Alan Turing Institute, Bloomington, IN, USA"],"affiliations":[{"raw_affiliation_string":"Indiana University & The Alan Turing Institute, Bloomington, IN, USA","institution_ids":["https://openalex.org/I4210119109"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018283928","display_name":"Samson Zhou","orcid":"https://orcid.org/0000-0001-8288-5698"},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samson Zhou","raw_affiliation_strings":["Indiana University, Bloomington, IN, USA"],"affiliations":[{"raw_affiliation_string":"Indiana University, Bloomington, IN, USA","institution_ids":["https://openalex.org/I4210119109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5091510008"],"corresponding_institution_ids":["https://openalex.org/I4210119109"],"apc_list":null,"apc_paid":null,"fwci":1.7459,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.86007312,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"148","last_page":"156"},"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.9994000196456909,"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.9994000196456909,"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/T10237","display_name":"Cryptography and Data Security","score":0.9879000186920166,"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.984000027179718,"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/knapsack-problem","display_name":"Knapsack problem","score":0.9575750827789307},{"id":"https://openalex.org/keywords/movielens","display_name":"MovieLens","score":0.7350481152534485},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7277580499649048},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5992904901504517},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5784814357757568},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.553551971912384},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.5489048957824707},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5218362212181091},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5070300102233887},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.49265819787979126},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4747645854949951},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.45288586616516113},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.41900983452796936},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39700454473495483},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.19210204482078552},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.09442716836929321},{"id":"https://openalex.org/keywords/recommender-system","display_name":"Recommender system","score":0.07088965177536011}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9575750827789307},{"id":"https://openalex.org/C2776156558","wikidata":"https://www.wikidata.org/wiki/Q4353746","display_name":"MovieLens","level":4,"score":0.7350481152534485},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7277580499649048},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5992904901504517},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5784814357757568},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.553551971912384},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.5489048957824707},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5218362212181091},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5070300102233887},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.49265819787979126},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4747645854949951},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.45288586616516113},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.41900983452796936},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39700454473495483},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.19210204482078552},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.09442716836929321},{"id":"https://openalex.org/C557471498","wikidata":"https://www.wikidata.org/wiki/Q554950","display_name":"Recommender system","level":2,"score":0.07088965177536011},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C21569690","wikidata":"https://www.wikidata.org/wiki/Q94702","display_name":"Collaborative filtering","level":3,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3292500.3330911","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3292500.3330911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W1997959284","https://openalex.org/W2000613522","https://openalex.org/W2033885045","https://openalex.org/W2051586153","https://openalex.org/W2100597616","https://openalex.org/W2109309418","https://openalex.org/W2132651631","https://openalex.org/W2141403143","https://openalex.org/W2177862760","https://openalex.org/W2560674852","https://openalex.org/W2604272474","https://openalex.org/W2755088640","https://openalex.org/W2799915114","https://openalex.org/W2809067649","https://openalex.org/W2809318113","https://openalex.org/W2883816296","https://openalex.org/W2944325705","https://openalex.org/W2962760143","https://openalex.org/W2962908181","https://openalex.org/W2963115142","https://openalex.org/W2963298316","https://openalex.org/W2964329817"],"related_works":["https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W2963443186","https://openalex.org/W4382197677","https://openalex.org/W2098281589","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W3128830699","https://openalex.org/W4313343266"],"abstract_inverted_index":{"We":[0,72],"propose":[1],"the":[2,50,67,74,105,126,133,147],"first":[3],"adversarially":[4],"robust":[5,34],"algorithm":[6,31],"for":[7,94,129],"monotone":[8],"submodular":[9],"maximization":[10],"under":[11,88],"single":[12,27],"and":[13,22,101,135],"multiple":[14,57],"knapsack":[15,28,58],"constraints":[16],"with":[17],"scalable":[18],"implementations":[19],"in":[20,151],"distributed":[21],"streaming":[23],"settings.":[24],"For":[25,56],"a":[26,33,46,64,115,130],"constraint,":[29],"our":[30,60,77,123],"outputs":[32],"summary":[35],"of":[36,66,76,84,132,149],"almost":[37],"optimal":[38,51],"(up":[39],"to":[40,49,81,141],"polylogarithmic":[41],"factors)":[42],"size,":[43],"from":[44,99,117],"which":[45],"constant-factor":[47,65],"approximation":[48,61],"solution":[52],"can":[53],"be":[54],"constructed.":[55],"constraints,":[59],"is":[62],"within":[63],"best":[68,127],"known":[69],"non-robust":[70,86],"solution.":[71],"evaluate":[73],"performance":[75,138],"algorithms":[78,87,124,143],"by":[79,104],"comparison":[80],"natural":[82],"robustifications":[83],"existing":[85],"two":[89],"objectives:":[90],"1)":[91],"dominating":[92],"set":[93,148],"large":[95],"social":[96],"network":[97],"graphs":[98],"Facebook":[100],"Twitter":[102],"collected":[103],"Stanford":[106],"Network":[107],"Analysis":[108],"Project":[109],"(SNAP),":[110],"2)":[111],"movie":[112],"recommendations":[113],"on":[114],"dataset":[116],"MovieLens.":[118],"Experimental":[119],"results":[120],"show":[121,136],"that":[122,144],"give":[125],"objective":[128],"majority":[131],"inputs":[134],"strong":[137],"even":[139],"compared":[140],"offline":[142],"are":[145],"given":[146],"removals":[150],"advance.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}