{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:18:20Z","timestamp":1755998300432,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Swiss NSF","award":["P2ELP2_181772"],"award-info":[{"award-number":["P2ELP2_181772"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,25]]},"DOI":"10.1145\/3292500.3330911","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"148-156","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Adversarially Robust Submodular Maximization under Knapsack Constraints"],"prefix":"10.1145","author":[{"given":"Dmitrii","family":"Avdiukhin","sequence":"first","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}]},{"given":"Slobodan","family":"Mitrovi\u0107","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"given":"Grigory","family":"Yaroslavtsev","sequence":"additional","affiliation":[{"name":"Indiana University &amp; The Alan Turing Institute, Bloomington, IN, USA"}]},{"given":"Samson","family":"Zhou","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"volume-title":"Submodular secretary problem with shortlists. arXiv preprint arXiv:1809.05082","year":"2018","author":"Agrawal Shipra","key":"e_1_3_2_1_1_1"},{"volume-title":"Robust submodular maximization: Offline and online algorithms. CoRR, abs\/1710.04740","year":"2017","author":"Anari Nima","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330911"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310454"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188752"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220081"},{"key":"e_1_3_2_1_8_1","first-page":"508","volume-title":"Proceedings of the 34th International Conference on Machine Learning, ICML","author":"Bogunovic Ilija","year":"2017"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"e_1_3_2_1_10_1","first-page":"210","volume-title":"IPCO. Proceedings","author":"Chakrabarti Amit","year":"2014"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310455"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.74"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020479"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310453"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310452"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2208436.2208448"},{"key":"e_1_3_2_1_17_1","first-page":"391","volume-title":"ICML","author":"Gomes Ryan","year":"2010"},{"key":"e_1_3_2_1_18_1","unstructured":"GroupLens. https:\/\/grouplens.org\/datasets\/movielens. MovieLens Datasets.  GroupLens. https:\/\/grouplens.org\/datasets\/movielens. MovieLens Datasets."},{"key":"e_1_3_2_1_19_1","first-page":"1","volume-title":"APPROX\/RANDOM","author":"Huang Chien-Chung","year":"2017"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_3_2_1_21_1","first-page":"2549","volume-title":"Proceedings of the 35th International Conference on Machine Learning, ICML","author":"Kazemi Ehsan","year":"2018"},{"volume-title":"Robust submodular observation selection. Journal of Machine Learning Research, 9(Dec):2761--2801","year":"2008","author":"Krause Andreas","key":"e_1_3_2_1_22_1"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0592"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2809814"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_1_26_1","unstructured":"Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014.  Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data June 2014."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2002472.2002537"},{"key":"e_1_3_2_1_28_1","first-page":"912","volume-title":"Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics","author":"Lin Hui","year":"2010"},{"key":"e_1_3_2_1_29_1","first-page":"1","volume-title":"2nd Symposium on Simplicity in Algorithms, SOSA@SODA 2019","author":"Liu Paul","year":"2019"},{"key":"e_1_3_2_1_30_1","first-page":"2449","volume-title":"International Conference on Machine Learning","author":"Mirzasoleiman Baharan","year":"2017"},{"key":"e_1_3_2_1_31_1","first-page":"2049","volume-title":"Advances in Neural Information Processing Systems","author":"Mirzasoleiman Baharan","year":"2013"},{"key":"e_1_3_2_1_32_1","first-page":"4560","volume-title":"Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems","author":"Mitrovi\u0107 Slobodan","year":"2017"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"volume-title":"arXiv preprint arXiv:1808.01842","year":"2018","author":"Norouzi-Fard Ashkan","key":"e_1_3_2_1_34_1"},{"volume-title":"Robust monotone submodular function maximization. Mathematical Programming, 172(1--2):505--537","year":"2018","author":"Orlin James B","key":"e_1_3_2_1_35_1"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396857"},{"volume-title":"Distributionally robust submodular maximization. CoRR, abs\/1802.05249","year":"2018","author":"Staib Matthew","key":"e_1_3_2_1_37_1"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"e_1_3_2_1_39_1","first-page":"721","volume-title":"Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies","author":"Wei Kai","year":"2013"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2871668"}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Anchorage AK USA","acronym":"KDD '19"},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330911","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330911","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:03Z","timestamp":1750206363000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":40,"alternative-id":["10.1145\/3292500.3330911","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3330911","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}