{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:00:51Z","timestamp":1743073251836,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811600098"},{"type":"electronic","value":"9789811600104"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-981-16-0010-4_6","type":"book-chapter","created":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:19:49Z","timestamp":1612829989000},"page":"58-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Streaming Algorithms for Monotone DR-Submodular Maximization Under a Knapsack Constraint on the Integer Lattice"],"prefix":"10.1007","author":[{"given":"Jingjing","family":"Tan","sequence":"first","affiliation":[]},{"given":"Dongmei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Hongyang","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhenning","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,7]]},"reference":[{"key":"6_CR1","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 KDD, pp. 671\u2013680 (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Schwartz, R.: Online submodular maximization with preemption. In: Proceedings of SODA, pp. 1202\u20131216 (2015)","DOI":"10.1137\/1.9781611973730.80"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Balkanski, E., Rubinstein, A., Singer, Y.: An exponential speedup in parallel running time for submodular maximization without loss in approximation. In: Proceedings of SODA, pp. 283\u2013302 (2019)","DOI":"10.1137\/1.9781611975482.19"},{"key":"6_CR4","unstructured":"C$$\\breve{a}$$linescu, G., Chekuri, C., P$$\\acute{a}$$l, M., Vondr$$\\acute{a}$$k, J.: Maximizing a momotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740\u20131766 (2011)"},{"key":"6_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."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Quanrud, K.: Submodular function maximization in parallel via the multilinear relaxation. In: Proceedings of SODA, pp. 303\u2013322 (2019)","DOI":"10.1137\/1.9781611975482.20"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Quanrud, K.: Randomize MWU for positive LPs. In: Proceedings of SODA, pp. 358\u2013377 (2018)","DOI":"10.1137\/1.9781611975031.25"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Das, A., Kempe, D.: Algorithms for subset selection in linear regression. In: Proceedings of STC, pp. 45\u201354 (2008)","DOI":"10.1145\/1374376.1374384"},{"key":"6_CR9","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: greedy algorithms for subset selection, sparse approximation and dictionary selection. In: Proceedings of ICML, pp. 1057\u20131064 (2011)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"EI-Arini, K., Guestrin, C.: Beyond keyword search: discovering relevant scientific literature. In: Proceedings of ICKDDM, pp. 439\u2013447 (2011)","DOI":"10.1145\/2020408.2020479"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Ene, A., Nguyen, H.L.: Submodular maximization with nearly-optimal approximation and adaptivity in nearly-linear time. In: Proceedings of SODA, pp. 274\u2013282 (2019)","DOI":"10.1137\/1.9781611975482.18"},{"key":"6_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. Global Optim. 75, 833\u2013849 (2019)","journal-title":"J. Global Optim."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Huang, C., Kakimura, N.: Improved streaming algorithms for maximising monotone submodular functions under a knapsack constraint. In: Proceedings of WADS, pp. 438\u2013451 (2019)","DOI":"10.1007\/978-3-030-24766-9_32"},{"issue":"5","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1007\/s11590-019-01430-z","volume":"14","author":"YJ Jiang","year":"2020","unstructured":"Jiang, Y.J., Wang, Y.S., Xu, D.C., Yang, R.Q., Zhang, Y.: Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint. Optim. Lett. 14(5), 1235\u20131248 (2020)","journal-title":"Optim. Lett."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Kapralov, M., Post, I., Vondr$$\\acute{a}$$k, J.: Online submodular welfare maximization: greedy is optimal. In: Proceedings of SODA, pp. 1216\u20131225 (2012)","DOI":"10.1137\/1.9781611973105.88"},{"key":"6_CR16","unstructured":"Khanna, R., Elenberg, E.R., Dimakis, A.G., Negahban, S., Ghosh, J.: Scalable greedy feature selection via weak submodularity. In: Proceedings of ICAIS, pp. 1560\u20131568 (2017)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"6_CR18","unstructured":"Norouzi-Fard, A., Tarnawski, J., Mitrovic, S., Zandieh, A., Mousavifar, A., Svensson, O. Beyong $$1\/2$$-approximation for submodular maximization on massive data streams. In: Proceedings of ICML, pp. 3829\u20133838 (2018)"},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko, M.: A note on maximizing a submodular set function subject to a knapsack constraint. Oper. Res. Lett. 32(1), 41\u201343 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793830909000063","volume":"1","author":"A Shioura","year":"2009","unstructured":"Shioura, A.: On the Pipage rounding algorithm for submodular function maximization-a view from discrete convex analysis. Discrete Math. Algorithms Appl. 1(1), 1\u201323 (2009)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"6_CR21","unstructured":"Soma, T., Kakimura, N., Inaba, K., Kawarabayashi, K.: Optimal budget allocation: theoretical guarantee and efficient algorithm. In: Proceedings of ICML, pp. 351\u2013359 (2014)"},{"key":"6_CR22","unstructured":"Soma, T., Yoshida, Y.: A generalization of submodular cover via the diminishing return property on the integer lattice. In: Proceedings of NIPS, pp. 847\u2013855 (2014)"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10107-018-1324-y","volume":"172","author":"T Soma","year":"2018","unstructured":"Soma, T., Yoshida, Y.: Maximization monotone submodular functions over the integer lattice. Math. Program. 172, 539\u2013563 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1287\/moor.7.3.410","volume":"7","author":"L Wolsey","year":"1982","unstructured":"Wolsey, L.: Maximising real-valued submodular set function: primal and dual heuristics for location problems. Math. Oper. Res. 7(3), 410\u2013425 (1982)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"6_CR25","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10898-019-00840-8","volume":"76","author":"YJ Wang","year":"2020","unstructured":"Wang, Y.J., Xu, D.C., Wang, Y.S., Zhang, D.M.: Non-submodular maximization on massive data streams. J. Global Optim. 76(4), 729\u2013743 (2020)","journal-title":"J. Global Optim."},{"key":"6_CR26","unstructured":"Yu, Q., Xu, E., Cui, S.: Streaming algorithms for news and scientific literature recommendation: submodular maximization with a d-knapsack constraint. In: Proceedings of IEEE GCSI (2016)"},{"issue":"4","key":"6_CR27","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1142\/S0217595919500222","volume":"36","author":"RQ Yang","year":"2019","unstructured":"Yang, R.Q., Xu, D.C., Jiang, Y.J., Wang, Y.S., Zhang, D.M.: Approximation robust parameterized submodular function maximaization in large-scales. Asia Pacific J. Oper. Res. 36(4), 195\u2013220 (2019)","journal-title":"Asia Pacific J. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Parallel Architectures, Algorithms and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-0010-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T14:43:14Z","timestamp":1617288194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-16-0010-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811600098","9789811600104"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-0010-4_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Parallel Architectures, Algorithms and Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"paap2020","order":10,"name":"conference_id","label":"Conference ID","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"37","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":"49% - 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","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":"6","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)"}}]}}