{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:29:09Z","timestamp":1743038949425,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_9","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"96-110","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Linear-Time Streaming Algorithm for\u00a0Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-5237-2012","authenticated-orcid":false,"given":"Min","family":"Cui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-0111-8572","authenticated-orcid":false,"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-0710-8498","authenticated-orcid":false,"given":"Ling","family":"Gai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-9100-9291","authenticated-orcid":false,"given":"Ruiqi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: massive data summarization on the fly. In: 20th International Proceedings on SIGKDD, pp. 671\u2013680. ACM, New York, USA (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"9_CR2","unstructured":"Bian, A.A., Buhmann, J.M., Krause, A., Tschiatschek, S.: Guarantees for greedy maximization of non-submodular functions with applications. In: 34th International Proceedings on ICML, pp. 498\u2013507. PMLR, Sydney, NSW, Australia (2017)"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3309764","volume":"15","author":"N Buchbinder","year":"2019","unstructured":"Buchbinder, N., Feldman, M., Schwartz, R.: Online submodular maximization with preemption. ACM Trans. Algorithms 15(3), 1\u201331 (2019)","journal-title":"ACM Trans. Algorithms"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Caldarola, E.G., Rinaldi, A.M.: Big data: a survey. In: 4th International Proceedings on DATA, pp. 362\u2013370. SciTePress, Colmar, Alsace, France (2015)","DOI":"10.5220\/0005580103620370"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-015-0900-7","volume":"154","author":"A Chakrabarti","year":"2015","unstructured":"Chakrabarti, A., Kale, S.: Submodular maximization meets streaming: matchings, matroids, and more. Math. Program. 154, 225\u2013247 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti, M., Cornu\u00e9jols, G.: Submodular set-functions, matroids and the greedy algorithm - tight worst-case bounds and some generalizations of the rado-edmonds theorem. Discrete Appl. Math. 7(3), 251\u2013274 (1984)","journal-title":"Discrete Appl. Math."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-030-57602-8_18","volume-title":"Algorithmic Aspects in Information and Management","author":"M Cui","year":"2020","unstructured":"Cui, M., Xu, D., Guo, L., Wu, D.: Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint. In: Zhang, Z., Li, W., Du, D.-Z. (eds.) AAIM 2020. LNCS, vol. 12290, pp. 195\u2013203. Springer, Cham (2020). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-57602-8_18"},{"key":"9_CR8","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection. In: 28th International Proceedings of ICML, pp. 1057\u20131064. Omnipress, Bellevue, Washington, USA (2011)"},{"key":"9_CR9","unstructured":"Elenberg, E. R., Dimakis, A. G., Feldman, M., Karbasi, A.: Streaming weak submodularity: interpreting neural networks on the fly. In: 31st International Proceedings on NIPS, pp. 4044\u20134054. Long Beach, CA, USA (2017)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Fahrbach, M., Mirrokn, V., Zadimoghaddam, M.: Submodular maximization with nearly optimal approximation, adaptivity and query complexity. In: 30th International Proceedings on SODA, pp. 255\u2013273. SIAM, San Diego, CA, USA (2019)","DOI":"10.1137\/1.9781611975482.17"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Feldman, M., Norouzi-Fard, A., Svensson, O., Zenklusen, R.: The one-way communication complexity of submodular maximization with applications to streaming and robustness. In: 52nd International Proceedings on STOC, pp. 1363\u20131374. ACM, Chicago, IL, USA (2020)","DOI":"10.1145\/3357713.3384286"},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/s10898-019-00800-2","volume":"75","author":"S Gong","year":"2019","unstructured":"Gong, S., Nong, Q., Liu, W., Fang, Q.: Parametric monotone function maximization with matroid constraints. J. Glob. Optim. 75(3), 833\u2013849 (2019). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s10898-019-00800-2","journal-title":"J. Glob. Optim."},{"key":"9_CR13","unstructured":"Kazemi, E., Mitrovic, M., Zadimoghaddam, M., Lattanzi, S., Karbasi, A.: Submodular streaming in all its glory: tight approximation, minimum memory and low adaptive complexity. In: 36th International Proceedings of ICML, pp. 3311\u20133320. PMLR, Long Beach, California, USA (2019)"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. Theor. Comput. 11(1), 105\u2013147 (2015)","journal-title":"Theor. Comput."},{"key":"9_CR15","unstructured":"Kuhnle, A.: Quick streaming algorithms for maximization of monotone submodular functions in linear time. In: 24th International Proceedings on AISTATS, pp. 13\u201315. PMLR, Virtual Event (2021)"},{"key":"9_CR16","unstructured":"Kuhnle, A., Smith, J., Crawford, V.G., Thai, M.T.: Fast maximization of non-submodular, monotonic functions on the integer lattice. In: 35th International Proceedings of ICML, pp. 2786\u20132795. PMLR, Stockholm, Sweden (2018)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Lakkaraju, H., Bach, S.H., Leskovec, J.: Interpretable decision sets: a joint framework for description and prediction. In: 22nd International Proceedings of SIGKDD, pp. 1675\u20131684. ACM, San Francisco, CA, USA (2016)","DOI":"10.1145\/2939672.2939874"},{"issue":"2","key":"9_CR18","doi-asserted-by":"publisher","first-page":"101312","DOI":"10.1016\/j.jacceco.2020.101312","volume":"69","author":"DF Larcker","year":"2020","unstructured":"Larcker, D.F., Watts, E.M.: Where\u2019s the greenium? J. Account. Econ. 69(2), 101312 (2020)","journal-title":"J. Account. Econ."},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Levin, R., Wajc, D.: Streaming submodular matching meets the primal-dual method. In: 32nd International Proceedings on SODA, pp. 1914\u20131933. SIAM, Virtual Conference (2021)","DOI":"10.1137\/1.9781611976465.114"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-030-57602-8_20","volume-title":"Algorithmic Aspects in Information and Management","author":"M Li","year":"2020","unstructured":"Li, M., Zhou, X., Tan, J., Wang, W.: Non-submodular streaming maximization with minimum memory and low adaptive complexity. In: Zhang, Z., Li, W., Du, D.-Z. (eds.) AAIM 2020. LNCS, vol. 12290, pp. 214\u2013224. Springer, Cham (2020). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-57602-8_20"},{"key":"9_CR21","unstructured":"Lin, H., Bilmes, J. A.: A class of submodular functions for document summarization. In: 49th International Proceedings on ACL, pp. 510\u2013520. The Association for Computer Linguistics, Portland, Oregon, USA (2011)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Lin, Y., Chen, W., Lui, J.C.: Boosting information spread: an algorithmic approach. In: 33rd International Proceedings on ICDE, pp. 883\u2013894. IEEE Computer Society, San Diego, CA, USA (2017)","DOI":"10.1109\/ICDE.2017.137"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-030-57602-8_19","volume-title":"Algorithmic Aspects in Information and Management","author":"B Liu","year":"2020","unstructured":"Liu, B., Hu, M.: Fast algorithms for maximizing monotone nonsubmodular functions. In: Zhang, Z., Li, W., Du, D.-Z. (eds.) AAIM 2020. LNCS, vol. 12290, pp. 204\u2013213. Springer, Cham (2020). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-57602-8_19"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"McGregor, A.: Graph stream algorithms: a survey. In: 31st International Proceedings of ICML, pp. 9\u201320. JMLR.org, Beijing, China (2014)","DOI":"10.1145\/2627692.2627694"},{"key":"9_CR25","unstructured":"Mirzasoleiman, B., Karbasi, A., Badanidiyuru, A., Krause, A.: Distributed submodular cover: succinctly summarizing massive data. In: 29th International Proceedings on NIPS, pp. 2881\u20132889. Montreal, Quebec, Canada (2015)"},{"key":"9_CR26","unstructured":"Mirzasoleiman, B., Karbasi, A., Sarkar, R., Krause, A.: Distributed submodular maximization: identifying representative elements in massive data. In: 27th International Proceedings on NIPS, pp. 2049\u20132057. Lake Tahoe, Nevada, USA (2013)"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Mossel, E., Roch, S.: On the submodularity of influence in social networks. In: 39th International Proceedings on STOC, pp. 128\u2013134. ACM, San Diego, California, USA (2007)","DOI":"10.1145\/1250790.1250811"},{"issue":"2","key":"9_CR28","first-page":"117","volume":"1","author":"S Muthukrishnan","year":"2005","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Theoret. Comput. Sci. 1(2), 117\u2013236 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-27195-4_23","volume-title":"Algorithmic Aspects in Information and Management","author":"Q Nong","year":"2019","unstructured":"Nong, Q., Sun, T., Gong, S., Fang, Q., Du, D., Shao, X.: Maximize a monotone function with a generic submodularity ratio. In: Du, D.-Z., Li, L., Sun, X., Zhang, J. (eds.) AAIM 2019. LNCS, vol. 11640, pp. 249\u2013260. Springer, Cham (2019). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-27195-4_23"},{"key":"9_CR30","unstructured":"Norouzi-Fard, A., Tarnawski, J., Mitrovic, S., Zandieh, A., Mousavifar, A., Svensson, O.: Beyond 1\/2-Approximation for submodular maximization on massive data streams. In: 35th International Proceedings of ICML, pp. 3826\u20133835. PMLR, Stockholm, Sweden (2018)"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Ribeiro, M. T., Singh, S., Guestrin, C.: \u201cWhy should I trust you?\u201d: explaining the predictions of any classifier. In: 22nd International Proceedings of SIGKDD, pp. 1135\u20131144. ACM, San Francisco, CA, USA (2016)","DOI":"10.1145\/2939672.2939778"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Sviridenko, M., Vondr\u00e1k, J., Ward, J.: Optimal approximation for submodular and supermodular optimization with bounded curvature. In: 26th International Proceedings on SODA, pp. 1134\u20131148. SIAM, San Diego, CA, USA (2015)","DOI":"10.1137\/1.9781611973730.76"},{"issue":"4","key":"9_CR33","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10898-019-00840-8","volume":"76","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Xu, D., Wang, Y., Zhang, D.: Non-submodular maximization on massive data streams. J. Glob. Optim. 76(4), 729\u2013743 (2019). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s10898-019-00840-8","journal-title":"J. Glob. Optim."},{"issue":"1","key":"9_CR34","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1186\/s13059-016-1089-7","volume":"17","author":"K Wei","year":"2016","unstructured":"Wei, K., Libbrecht, M.W., Bilmes, J.A., Noble, W.S.: Choosing panels of genomics assays using submodular optimization. Genom. Biol. 17(1), 229 (2016)","journal-title":"Genom. Biol."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T06:06:26Z","timestamp":1726293986000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/978-3-030-92681-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":34,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-92681-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2.zoppoz.workers.dev:443\/http\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.75","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}