{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:48:35Z","timestamp":1772164115174,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T00:00:00Z","timestamp":1622419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Foundation of China (NSFC)","award":["61772491"],"award-info":[{"award-number":["61772491"]}]},{"name":"National Key R&D Program of China","award":["2018AAA0101204"],"award-info":[{"award-number":["2018AAA0101204"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,5,31]]},"DOI":"10.1145\/3410220.3453922","type":"proceedings-article","created":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T06:11:02Z","timestamp":1622959862000},"page":"65-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint"],"prefix":"10.1145","author":[{"given":"Kai","family":"Han","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, HeFei, China"}]},{"given":"Shuang","family":"Cui","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, HeFei, China"}]},{"given":"Tianshuai","family":"Zhu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, HeFei, China"}]},{"given":"Enpei","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, HeFei, China"}]},{"given":"Benwei","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, HeFei, China"}]},{"given":"Zhizhuo","family":"Yin","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, HeFei, China"}]},{"given":"Tong","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, HeFei, China"}]},{"given":"Shaojie","family":"Tang","sequence":"additional","affiliation":[{"name":"University of Texas at Dallas, Dallas, TX, USA"}]},{"given":"He","family":"Huang","sequence":"additional","affiliation":[{"name":"Soochow University, Suzhou, China"}]}],"member":"320","published-online":{"date-parts":[[2021,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Neural Information Processing Systems (NeurIPS), arXiv","author":"Amanatidis Georgios","year":"2007","unstructured":"Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, and Rebecca Reiffenh\"auser. 2020. Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. In Neural Information Processing Systems (NeurIPS), arXiv: 2007.05014."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17572-5_20"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3311880.3311884"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2922271"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2846569"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213883"},{"key":"e_1_3_2_2_8_1","volume-title":"Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization. preprint, arXiv:1802.06212","author":"Huang Chien-Chung","year":"2018","unstructured":"Chien-Chung Huang and Naonori Kakimura. 2018. Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization. preprint, arXiv:1802.06212 (2018)."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24766-9_32"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-019-00628-y"},{"key":"e_1_3_2_2_11_1","volume-title":"Tractability: Practical Approaches to Hard Problems","author":"Krause Andreas","year":"2014","unstructured":"Andreas Krause and Daniel Golovin. 2014. Tractability: Practical Approaches to Hard Problems .Cambridge University Press. 71--104 pages."},{"key":"e_1_3_2_2_12_1","volume-title":"Fast Constrained Submodular Maximization: Personalized Data Summarization. In International Conference on Machine Learning (ICML). 1358--1367","author":"Mirzasoleiman Baharan","year":"2016","unstructured":"Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, and Amin Karbasi. 2016. Fast Constrained Submodular Maximization: Personalized Data Summarization. In International Conference on Machine Learning (ICML). 1358--1367."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737400"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10207"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396857"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.7.3.410"},{"key":"e_1_3_2_2_17_1","volume-title":"International Conference on Artificial Intelligence and Statistics (AISTATS). 3263--3274","author":"Yaroslavtsev Grigory","year":"2020","unstructured":"Grigory Yaroslavtsev, Samson Zhou, and Dmitrii Avdiukhin. 2020. \"Bring your own greedy\" + max: Near-optimal 1\/2-approximations for submodular knapsack. In International Conference on Artificial Intelligence and Statistics (AISTATS). 3263--3274."}],"event":{"name":"SIGMETRICS '21: ACM SIGMETRICS \/ International Conference on Measurement and Modeling of Computer Systems","location":"Virtual Event China","acronym":"SIGMETRICS '21","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Abstract Proceedings of the 2021 ACM SIGMETRICS \/ International Conference on Measurement and Modeling of Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3410220.3453922","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3410220.3453922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:40:59Z","timestamp":1750185659000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3410220.3453922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,31]]},"references-count":17,"alternative-id":["10.1145\/3410220.3453922","10.1145\/3410220"],"URL":"https:\/\/doi.org\/10.1145\/3410220.3453922","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3543516.3453922","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2021,5,31]]},"assertion":[{"value":"2021-06-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}