{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T04:16:32Z","timestamp":1745381792388,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030914332"},{"type":"electronic","value":"9783030914349"}],"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:\/\/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:\/\/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-91434-9_3","type":"book-chapter","created":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T12:04:42Z","timestamp":1638533082000},"page":"27-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Streaming Algorithms for Budgeted k-Submodular Maximization Problem"],"prefix":"10.1007","author":[{"given":"Canh V.","family":"Pham","sequence":"first","affiliation":[]},{"given":"Quang C.","family":"Vu","sequence":"additional","affiliation":[]},{"given":"Dung K. T.","family":"Ha","sequence":"additional","affiliation":[]},{"given":"Tai T.","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,4]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: massive data summarization on the fly. In: Macskassy, S.A., Perlich, C., Leskovec, J., Wang, W., Ghani, R. (eds.) The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2014, pp. 671\u2013680. ACM (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Chakrabarti, A., Kale, S.: Submodular maximization meets streaming: matchings, matroids, and more. Math. Program. 225\u2013247 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0900-7","DOI":"10.1007\/s10107-015-0900-7"},{"key":"3_CR3","unstructured":"Gomes, R., Krause, A.: Budgeted nonparametric learning from data streams. In: F\u00fcrnkranz, J., Joachims, T. (eds.) Proceedings of the 27th International Conference on Machine Learning (ICML 2010), Haifa, Israel, 21\u201324 June 2010, pp. 391\u2013398. Omnipress (2010)"},{"key":"3_CR4","unstructured":"Haba, R., Kazemi, E., Feldman, M., Karbasi, A.: Streaming submodular maximization under a k-set system constraint. In: Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13\u201318 July 2020, Virtual Event. Proceedings of Machine Learning Research, vol. 119, pp. 3939\u20133949. PMLR (2020)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Huang, C., Kakimura, N., Yoshida, Y.: Streaming algorithms for maximizing monotone submodular functions under a Knapsack constraint. Algorithmica 82(4), 1006\u20131032 (2020)","DOI":"10.1007\/s00453-019-00628-y"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Iwata, S., Tanigawa, S., Yoshida, Y.: Improved approximation algorithms for k-submodular function maximization. In: Krauthgamer, R. (ed.) Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January 2016, pp. 404\u2013413. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch30"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Kumar, R., Moseley, B., Vassilvitskii, S., Vattani, A.: Fast greedy algorithms in mapreduce and streaming. In: Blelloch, G.E., V\u00f6cking, B. (eds.) 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013, pp. 1\u201310. ACM (2013)","DOI":"10.1145\/2486159.2486168"},{"key":"3_CR8","unstructured":"Nguyen, L., Thai, M.: Streaming k-submodular maximization under noise subject to size constraint. In: Daum\u00e9, H., Singh, A. (eds.) Proceedings of the International Conference on Machine Learning, (ICML-2020), Thirty-Seventh International Conference on Machine Learning (2020)"},{"key":"3_CR9","unstructured":"Ohsaka, N., Yoshida, Y.: Monotone k-submodular function maximization with size constraints. In: Cortes, C., Lawrence, N.D., Lee, D.D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, Montreal, Quebec, Canada, 7\u201312 December 2015, pp. 694\u2013702 (2015)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-78825-8_8","volume-title":"Combinatorial Algorithms","author":"H Oshima","year":"2018","unstructured":"Oshima, H.: Derandomization for k-submodular maximization. In: Brankovic, L., Ryan, J., Smyth, W.F. (eds.) IWOCA 2017. LNCS, vol. 10765, pp. 88\u201399. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78825-8_8"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/TEVC.2017.2749263","volume":"22","author":"C Qian","year":"2018","unstructured":"Qian, C., Shi, J., Tang, K., Zhou, Z.: Constrained monotone k-submodular function maximization using multiobjective evolutionary algorithms with theoretical guarantee. IEEE Trans. Evol. Comput. 22(4), 595\u2013608 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3_CR12","unstructured":"Rafiey, A., Yoshida, Y.: Fast and private submodular and k-submodular functions maximization with matroid constraints. In: Proceedings of the 37th International Conference on Machine Learning, ICML 2020. Proceedings of Machine Learning Research, vol. 119, pp. 7887\u20137897. PMLR (2020)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.disopt.2017.01.003","volume":"23","author":"S Sakaue","year":"2017","unstructured":"Sakaue, S.: On maximizing a monotone k-submodular function subject to a matroid constraint. Discret. Optim. 23, 105\u2013113 (2017)","journal-title":"Discret. Optim."},{"key":"3_CR14","unstructured":"Singh, A.P., Guillory, A., Bilmes, J.A.: On bisubmodular maximization. In: Lawrence, N.D., Girolami, M.A. (eds.) Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics, AISTATS 2012. JMLR Proceedings, vol. 22, pp. 1055\u20131063. JMLR.org (2012)"},{"key":"3_CR15","unstructured":"Soma, T.: No-regret algorithms for online $$k$$-submodular maximization. In: Chaudhuri, K., Sugiyama, M. (eds.) The 22nd International Conference on Artificial Intelligence and Statistics, AISTATS 2019, Naha, Okinawa, Japan, 16\u201318 April 2019. Proceedings of Machine Learning Research, vol. 89, pp. 1205\u20131214. PMLR (2019)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Thapper, J., Zivn\u00fd, S.: The power of linear programming for valued CSPs. In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, 20\u201323 October 2012, pp. 669\u2013678. IEEE Computer Society (2012)","DOI":"10.1109\/FOCS.2012.25"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Ward, J., Zivn\u00fd, S.: Maximizing bisubmodular and k-submodular functions. In: Chekuri, C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 5\u20137 January 2014, pp. 1468\u20131481. SIAM (2014)","DOI":"10.1137\/1.9781611973402.108"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Yang, R., Xu, D., Cheng, Y., Gao, C., Du, D.: Streaming submodular maximization under noises. In: 39th IEEE International Conference on Distributed Computing Systems, ICDCS 2019, Dallas, TX, USA, 7\u201310 July 2019, pp. 348\u2013357. IEEE (2019)","DOI":"10.1109\/ICDCS.2019.00042"}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91434-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T18:13:17Z","timestamp":1726251197000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91434-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030914332","9783030914349"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91434-9_3","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":"4 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Data and Social Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csonet-conf.github.io\/","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":"57","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":"24","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":"42% - 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)"}}]}}