{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:47:27Z","timestamp":1767340047797,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031207952"},{"type":"electronic","value":"9783031207969"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20796-9_10","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"129-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Streaming Submodular Maximization with\u00a0the\u00a0Chance Constraint"],"prefix":"10.1007","author":[{"given":"Shufang","family":"Gong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8958-3999","authenticated-orcid":false,"given":"Bin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qizhi","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A.: Streaming submodular maximization: massive data summarization on the fly. In: 20th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 671\u2013680, Assiciation for Computing Machinery, New York, NY, USA (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.jda.2013.06.006","volume":"22","author":"C Bazgan","year":"2013","unstructured":"Bazgan, C., Gourves, L., Monnot, J.: Approximation with a fixed number of solutions of some multi objective maximization problems. J. Discrete Algorithms 22, 19\u201329 (2013)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"10_CR3","volume":"2","author":"A-W Berning","year":"2020","unstructured":"Berning, A.-W., Girard, A., Kolmanovsky, I.: Rapid uncertainty propagation and chance-constrained path planning for small unmanned aerial vehicles. Adv. Control Appl. Eng. Ind. Syst. 2(1), e23 (2020)","journal-title":"Adv. Control Appl. Eng. Ind. Syst."},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-72792-7_15","volume-title":"Integer Programming and Combinatorial Optimization","author":"G Calinescu","year":"2007","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 182\u2013196. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_15"},{"key":"10_CR5","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":"10_CR6","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Gupta, S., Quanrud, K.: Streaming algorithms for submodular function maximization. In: 42nd International Colloquium on Automata, Languages, and Programming, pp.318-330. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-662-47672-7_26"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Doerr, B., Doerr, C., Neumann, A.: Optimization of chance-constrained submodular functions. In: 34th AAAI Conference on Artificial Intelligence. 34, pp. 1460\u20131467. Association for the Advancement of Artifical Intelligence, New York, NY, USA (2020)","DOI":"10.1609\/aaai.v34i02.5504"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"10_CR9","unstructured":"Feldman, M., Karbasi, A., Kazemi, E.: Do less, get more: streaming submodular maximization with subsampling. Advances in Neural Information Processing Systems, 31 (2018)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Feldman, M., Norouzi-Fard, A., Svensson, O.: The one-way communication complexity of submodular maximization with applications to streaming and robustness. In: 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1363\u20131374, Association for Computing Machinery, Chicago, IL, USA (2020)","DOI":"10.1145\/3357713.3384286"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Fisher, M.-L., Nemhauser, G.-L., Wolsey, L.-A.: An analysis of approximations for maximizing submodular set functions-II. In: Balinski, M.L., Hoffman, A.J. (eds.) Polyhedral combinatorics. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/BFb0121195","DOI":"10.1007\/BFb0121195"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.automatica.2019.03.027","volume":"105","author":"D Frick","year":"2019","unstructured":"Frick, D., Sessa, P.-G., Wood, T.-A.: Exploiting structure of chance constrained programs via submodularity. Automatica 105, 89\u201395 (2019)","journal-title":"Automatica"},{"issue":"6","key":"10_CR13","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T Hagerup","year":"1990","unstructured":"Hagerup, T., Rub, C.: A guided tour of Chernoff bounds. Inf. Process. Lett. 33(6), 305\u2013308 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s00453-020-00786-4","volume":"83","author":"C-C Huang","year":"2021","unstructured":"Huang, C.-C., Kakimura, N.: Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. Algorithms 83(3), 879\u2013902 (2021)","journal-title":"Algorithms"},{"issue":"4","key":"10_CR15","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1007\/s00453-019-00628-y","volume":"82","author":"C-C Huang","year":"2020","unstructured":"Huang, C.-C., Kakimura, N., Yoshida, Y.: Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint. Algorithms 82(4), 1006\u20131032 (2020)","journal-title":"Algorithms"},{"issue":"5","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1007\/s11590-019-01430-z","volume":"14","author":"Y Jiang","year":"2020","unstructured":"Jiang, Y., Wang, Y., Xu, D.: Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint. Optimization Letters 14(5), 1235\u20131248 (2020)","journal-title":"Optimization Letters"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s11590-019-01445-6","volume":"14","author":"S Joung","year":"2020","unstructured":"Joung, S., Lee, K.: Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity. Optimization Letters 14(1), 101\u2013113 (2020)","journal-title":"Optimization Letters"},{"key":"10_CR18","unstructured":"Kazemi, E., Mitrovic, M., Zadimoghaddam, M.: Submodular streaming in all its glory: tight approximation, minimum memory and low adaptive complexity. In: 36th International Conference on Machine Learning, pp. 3311\u20133320. International Machine Learning Society, Long Beach, California, USA (2019)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: 9th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 137\u2013146. Association for Computing Machinery, Washington, DC, USA (2003)","DOI":"10.1145\/956750.956769"},{"issue":"1","key":"10_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.-S.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Marshall, A.-W., Olkin, I.: A one-sided inequality of the Chebyshev type. The Ann. Math. Stat. 31, 488\u2013491 (1960)","DOI":"10.1214\/aoms\/1177705913"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.-L., Wolsey, L.-A.,: Fisher M L.: An analysis of approximations for maximizing submodular set functions-I. Math. program. 14(1), 265\u2013294 (1978)","DOI":"10.1007\/BF01588971"},{"issue":"3","key":"10_CR23","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/moor.3.3.177","volume":"3","author":"G-L Nemhauser","year":"1978","unstructured":"Nemhauser, G.-L., Wolsey, L.-A.: Best algorithms for approximating the maximum of a submodular set function. Math. Oper. Res. 3(3), 177\u2013188 (1978)","journal-title":"Math. Oper. Res."},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-030-58112-1_28","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"A Neumann","year":"2020","unstructured":"Neumann, A., Neumann, F.: Optimising monotone chance-constrained submodular functions using evolutionary multi-objective algorithms. In: B\u00e4ck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 404\u2013417. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_28"},{"issue":"1","key":"10_CR25","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":"6","key":"10_CR26","first-page":"2074","volume":"29","author":"L Trevisan","year":"2000","unstructured":"Trevisan, L., Sorkin, G.-B., Sudan, M.: Gadgets, approximation, and linear programming. J. Comput 29(6), 2074\u20132097 (2000)","journal-title":"J. Comput"},{"issue":"3","key":"10_CR27","doi-asserted-by":"publisher","first-page":"2324","DOI":"10.1109\/TSG.2019.2951797","volume":"11","author":"B Wang","year":"2019","unstructured":"Wang, B., Dehghanian, P., Zhao, D.: Chance-constrained energy management system for power grids with high proliferation of renewables and electric vehicles. IEEE Trans. Smart Grid 11(3), 2324\u20132336 (2019)","journal-title":"IEEE Trans. Smart Grid"},{"issue":"4","key":"10_CR28","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10898-019-00840-8","volume":"76","author":"Y Wang","year":"2020","unstructured":"Wang, Y., Xu, D., Wang, Y.: Non-submodular maximization on massive data streams. J. Global Optim. 76(4), 729\u2013743 (2020)","journal-title":"J. Global Optim."},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Xie, Y., Neumann, A., Neumann, F.: Specific single-and multi-objective evolutionary algorithms for the chance-constrained knapsack problem. In: 22th Genetic and Evolutionary Computation Conference, pp. 271\u2013279. Association for Computing Machinery, Canc\u00fan Mexico (2020)","DOI":"10.1145\/3377930.3390162"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Xie, Y., Harper, O., Assimi, H.: Evolutionary algorithms for the chance-constrained knapsack problem. In: 21th Genetic and Evolutionary Computation Conference, pp. 338\u2013346. Association for Computing Machinery, Prague, Czech Republic (2019)","DOI":"10.1145\/3321707.3321869"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Zhang, H., Vorobeychik, Y.: Submodular optimization with routing constraints. In: 30th AAAI conference on artificial intelligence, pp. 819\u2013826. Association for the Advancement of Artifical Intelligence, Phoenix, Arizona, USA (2016)","DOI":"10.1609\/aaai.v30i1.10066"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmic Wisdom"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20796-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:48:19Z","timestamp":1672552099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20796-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031207952","9783031207969"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20796-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/ijtcs2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","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":"19","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":"76% - 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":"3","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)"}}]}}