{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:40:35Z","timestamp":1726062035645},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030364113"},{"type":"electronic","value":"9783030364120"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-36412-0_46","type":"book-chapter","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T00:04:15Z","timestamp":1575590655000},"page":"565-575","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sequence Submodular Maximization Meets Streaming"],"prefix":"10.1007","author":[{"given":"Ruiqi","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongmei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,23]]},"reference":[{"key":"46_CR1","unstructured":"Alaluf, N., Feldman, M.: Making a sieve random: improved semi-streaming algorithm for submodular maximization under a cardinality constraint. arXiv preprint arXiv:1906.11237 (2019)"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: massive data summarization on the fly. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 671\u2013680. ACM (2014)","DOI":"10.1145\/2623330.2623637"},{"issue":"1\u20132","key":"46_CR3","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(1\u20132), 225\u2013247 (2015)","journal-title":"Math. Program."},{"key":"46_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-662-47672-7_26","volume-title":"Automata, Languages, and Programming","author":"C Chekuri","year":"2015","unstructured":"Chekuri, C., Gupta, S., Quanrud, K.: Streaming algorithms for submodular function maximization. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 318\u2013330. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47672-7_26"},{"key":"46_CR5","unstructured":"Feldman, M., Karbasi, A., Kazemi, E.: Do less, get more: streaming submodular maximization with subsampling. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, pp. 730\u2013740. Curran Associates Inc. (2018)"},{"issue":"1","key":"46_CR6","first-page":"427","volume":"42","author":"D Golovin","year":"2011","unstructured":"Golovin, D., Krause, A.: Adaptive submodularity: theory and applications in active learning and stochastic optimization. J. Artif. Intell. Res. 42(1), 427\u2013486 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"46_CR7","unstructured":"Huang, C.-C., Kakimura, N., Yoshida, Y.: Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. In: Proceedings of the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 21st International Workshop on Randomization and Computation, No. 11. Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing (2017)"},{"issue":"82","key":"46_CR8","first-page":"1","volume":"13","author":"Y Jiang","year":"2019","unstructured":"Jiang, Y., Wang, Y., Xu, D., Yang, R., Zhang, Y.: Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint. Optim. Lett. 13(82), 1\u201314 (2019)","journal-title":"Optim. Lett."},{"key":"46_CR9","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: Proceedings of the 36th International Conference on Machine Learning, pp. 3311\u20133320. ACM (2019)"},{"key":"46_CR10","unstructured":"Mitrovic, M., Feldman, M., Krause, A., Karbasi, A.: Submodularity on hypergraphs: from sets to sequences. In: Proceedings of the 21st International Conference on Artificial Intelligence and Statistics, pp. 1177\u20131184. PMLR (2018)"},{"key":"46_CR11","unstructured":"Mitrovic, M., Kazemi, E., Feldman, M., Krause, A., Karbasi, A.: Adaptive sequence submodularity. arXiv preprint arXiv:1902.05981 (2019)"},{"key":"46_CR12","unstructured":"Norouzi-Fard, A., Tarnawski, J., Mitrovi\u0107 S, Zandieh, A., Mousavifar, A., and Svensson, O.: Beyond $$1\/2$$-approximation for submodular maximization on massive data streams. In: Proceedings of the 35th International Conference on Machine Learning, pp. 3826\u20133835. ACM (2018)"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"Tschiatschek, S., Singla, A., Krause, A.: Selecting sequences of items via submodular maximization. In: Proceedings of the 31st AAAI Conference on Artificial Intelligence, pp. 2667\u20132673. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10923"},{"key":"46_CR14","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-16194-1_5","volume-title":"Nonlinear Combinatorial Optimization","author":"R Yang","year":"2019","unstructured":"Yang, R., Xu, D., Li, M., Xu, Y.: Thresholding methods for streaming submodular maximization with a cardinality constraint and its variants. In: Du, D.-Z., Pardalos, P.M., Zhang, Z. (eds.) Nonlinear Combinatorial Optimization. SOIA, vol. 147, pp. 123\u2013140. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16194-1_5"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36412-0_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,7]],"date-time":"2022-10-07T20:40:14Z","timestamp":1665175214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36412-0_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030364113","9783030364120"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36412-0_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 November 2019","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":"Xiamen","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoaconference.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"108","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":"49","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":"0","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":"45% - 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":"3.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":"10","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}