{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:44:47Z","timestamp":1787017487577,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100017052","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172384, U20A20182, U22B2060"],"award-info":[{"award-number":["62172384, U20A20182, U22B2060"]}],"id":[{"id":"10.13039\/100017052","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583490","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T19:30:51Z","timestamp":1682537451000},"page":"1822-1831","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Constrained Subset Selection from Data Streams for Profit Maximization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6080-4850","authenticated-orcid":false,"given":"Shuang","family":"Cui","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, University of Science and Technology of China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6302-5366","authenticated-orcid":false,"given":"Kai","family":"Han","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0785-707X","authenticated-orcid":false,"given":"Jing","family":"Tang","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology (Guangzhou), The Hong Kong University of Science and Technology, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2768-6607","authenticated-orcid":false,"given":"He","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Soochow University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Ashwinkumar Badanidiyuru Amin Karbasi Ehsan Kazemi and Jan Vondr\u00e1k. 2020. Submodular maximization through barrier functions. In Advances in Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623637"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.106"},{"key":"e_1_3_2_1_4_1","unstructured":"Yixin Chen Tonmoy Dey and Alan Kuhnle. 2021. Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel. In Advances in Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_5_1","volume-title":"International Conference on Machine Learning (ICML). 2222\u20132232","author":"Cui Shuang","year":"2021","unstructured":"Shuang Cui, Kai Han, Tianshuai Zhu, Jing Tang, Benwei Wu, and He Huang. 2021. Randomized Algorithms for Submodular Function Maximization with a k -System Constraint. In International Conference on Machine Learning (ICML). 2222\u20132232."},{"key":"e_1_3_2_1_6_1","unstructured":"Marwa El\u00a0Halabi Slobodan Mitrovi\u0107 Ashkan Norouzi-Fard Jakab Tardos and Jakub\u00a0M Tarnawski. 2020. Fairness in streaming submodular maximization: algorithms and hardness. In Advances in Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052699"},{"key":"e_1_3_2_1_8_1","volume-title":"European Symposium on Algorithms (ESA), Vol.\u00a0173","author":"Fairstein Yaron","year":"2020","unstructured":"Yaron Fairstein, Ariel Kulik, Joseph\u00a0Seffi Naor, Danny Raz, and Hadas Shachnai. 2020. A (1 \u2212 e\u2212 1 \u2212 \u03b5)-Approximation for the Monotone Submodular Multiple Knapsack Problem. In European Symposium on Algorithms (ESA), Vol.\u00a0173. 44:1\u201344:19."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00757-9"},{"key":"e_1_3_2_1_10_1","volume-title":"Conference on Learning Theory (COLT). 758\u2013784","author":"Feldman Moran","year":"2017","unstructured":"Moran Feldman, Christopher Harshaw, and Amin Karbasi. 2017. Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization. In Conference on Learning Theory (COLT). 758\u2013784."},{"key":"e_1_3_2_1_11_1","volume-title":"How Do You Want Your Greedy: Simultaneous or Repeated?arXiv preprint arXiv:2009.13998","author":"Feldman Moran","year":"2020","unstructured":"Moran Feldman, Christopher Harshaw, and Amin Karbasi. 2020. How Do You Want Your Greedy: Simultaneous or Repeated?arXiv preprint arXiv:2009.13998 (2020)."},{"key":"e_1_3_2_1_12_1","unstructured":"Moran Feldman Amin Karbasi and Ehsan Kazemi. 2018. Do less get more: Streaming submodular maximization with subsampling. In Advances in Neural Information Processing Systems (NeurIPS). 732\u2013742."},{"key":"e_1_3_2_1_13_1","volume-title":"International Conference on Machine Learning (ICML).","author":"Haba Ran","year":"2020","unstructured":"Ran Haba, Ehsan Kazemi, Moran Feldman, and Amin Karbasi. 2020. Streaming Submodular Maximization under a k -Set System Constraint. In International Conference on Machine Learning (ICML)."},{"key":"e_1_3_2_1_14_1","unstructured":"Kai Han Zongmai Cao Shuang Cui and Benwei Wu. 2020. Deterministic approximation for submodular maximization over a matroid in nearly linear time. In Advances in Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_15_1","volume-title":"The movielens datasets: History and context. Acm transactions on interactive intelligent systems (TiiS) 5, 4","author":"Harper F\u00a0Maxwell","year":"2015","unstructured":"F\u00a0Maxwell Harper and Joseph\u00a0A Konstan. 2015. The movielens datasets: History and context. Acm transactions on interactive intelligent systems (TiiS) 5, 4 (2015), 1\u201319."},{"key":"e_1_3_2_1_16_1","volume-title":"International Conference on Machine Learning (ICML). 2634\u20132643","author":"Harshaw Chris","year":"2019","unstructured":"Chris Harshaw, Moran Feldman, Justin Ward, and Amin Karbasi. 2019. Submodular maximization beyond non-negativity: Guarantees, fast algorithms, and applications. In International Conference on Machine Learning (ICML). 2634\u20132643."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3467861.3467866"},{"key":"e_1_3_2_1_18_1","volume-title":"International Conference on Machine Learning (ICML). 5356\u20135366","author":"Kazemi Ehsan","year":"2021","unstructured":"Ehsan Kazemi, Shervin Minaee, Moran Feldman, and Amin Karbasi. 2021. Regularized submodular maximization at scale. In International Conference on Machine Learning (ICML). 5356\u20135366."},{"key":"e_1_3_2_1_19_1","volume-title":"International Conference on Machine Learning (ICML). 3311\u20133320","author":"Kazemi Ehsan","year":"2019","unstructured":"Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi, and Amin Karbasi. 2019. Submodular streaming in all its glory: Tight approximation, minimum memory and low adaptive complexity. In International Conference on Machine Learning (ICML). 3311\u20133320."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-9496(2008)134:6(516)"},{"key":"e_1_3_2_1_22_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_23_1","volume-title":"Regularized non-monotone submodular maximization. arXiv preprint arXiv:2103.10008","author":"Lu Cheng","year":"2021","unstructured":"Cheng Lu, Wenguo Yang, and Suixiang Gao. 2021. Regularized non-monotone submodular maximization. arXiv preprint arXiv:2103.10008 (2021)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.145"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_48"},{"key":"e_1_3_2_1_26_1","volume-title":"International Conference on Machine Learning (ICML). 1358\u20131367","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\u20131367."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467367"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.60"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052612"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488489"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1609\/hcomp.v1i1.13068"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380275"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0842"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2787757"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449799"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92681-6_7"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","location":"Austin TX USA","acronym":"WWW '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583490","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583490","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T12:47:02Z","timestamp":1750164422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583490"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":36,"alternative-id":["10.1145\/3543507.3583490","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583490","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}