{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:42:38Z","timestamp":1746438158685,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031263026"},{"type":"electronic","value":"9783031263033"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26303-3_24","type":"book-chapter","created":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T16:08:38Z","timestamp":1676045318000},"page":"268-279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Non-monotone k-Submodular Function Maximization with\u00a0Individual Size Constraints"],"prefix":"10.1007","author":[{"given":"Hao","family":"Xiao","sequence":"first","affiliation":[]},{"given":"Qian","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Min","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,11]]},"reference":[{"key":"24_CR1","unstructured":"Ene, A., Nguyen, H.: Streaming algorithm for monotone $$k$$-submodular maximization with cardinality constraints. In: Proceedings of ICML, pp. 5944\u20135967 (2022)"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-32147-4_40","volume-title":"Combinatorial Optimization","author":"A Huber","year":"2012","unstructured":"Huber, A., Kolmogorov, V.: Towards minimizing k-submodular functions. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol. 7422, pp. 451\u2013462. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32147-4_40"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Iwata, S., Tanigawa, S., Yoshida, Y.: Improved approximation algorithms for $$k$$-submodular function maximization. In: Proceedings of SODA, pp. 404\u2013413 (2016)","DOI":"10.1137\/1.9781611974331.ch30"},{"issue":"8","key":"24_CR4","first-page":"235","volume":"9","author":"A Krause","year":"2008","unstructured":"Krause, A., Singh, A., Guestrin, C.: Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies. J. Mach. Learn. Res. 9(8), 235\u2013284 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"24_CR5","unstructured":"Nguyen, L., Thai, M.: Streaming $$k$$-submodular maximization under noise subject to size constraint. In: Proceedings of ICML, pp. 7338\u20137347 (2020)"},{"key":"24_CR6","unstructured":"Ohsaka, N., Yoshida, Y.: Monotone $$k$$-submodular function maximization with size constraints. In: Proceedings of NeurIPS, pp. 694\u2013702 (2015)"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/19M1277692","volume":"35","author":"H Oshima","year":"2021","unstructured":"Oshima, H.: Improved randomized algorithm for $$k$$-submodular function maximization. SIAM J. Discrete Math. 35(1), 1\u201322 (2021)","journal-title":"SIAM J. Discrete Math."},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-030-91434-9_3","volume-title":"Computational Data and Social Networks","author":"CV Pham","year":"2021","unstructured":"Pham, C.V., Vu, Q.C., Ha, D.K.T., Nguyen, T.T.: Streaming algorithms for budgeted k-submodular maximization problem. In: Mohaisen, D., Jin, R. (eds.) CSoNet 2021. LNCS, vol. 13116, pp. 27\u201338. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91434-9_3"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s10878-022-00858-x","volume":"44","author":"C Pham","year":"2022","unstructured":"Pham, C., Vu, Q., Ha, D., Nguyen, T., Le, N.: Maximizing $$k$$-submodular functions under budget constraint: applications and streaming algorithms. J. Comb. Optim. 44, 723\u2013751 (2022). https:\/\/doi.org\/10.1007\/s10878-022-00858-x","journal-title":"J. Comb. Optim."},{"key":"24_CR10","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, 595\u2013608 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"24_CR11","unstructured":"Rafiey, A., Yoshida, Y.: Fast and private submodular and $$k$$-submodular functions maximization with matroid constraints. In: Proceeding of ICML, pp. 7887\u20137897 (2020)"},{"key":"24_CR12","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. Discrete Optim. 23, 105\u2013113 (2017)","journal-title":"Discrete Optim."},{"issue":"4","key":"24_CR13","doi-asserted-by":"publisher","first-page":"2150036","DOI":"10.1142\/S1793830921500361","volume":"13","author":"G Shi","year":"2021","unstructured":"Shi, G., Gu, S., Wu, W.: $$k$$-submodular maximization with two kinds of constraints. Discrete Math. Algorithms Appl. 13(4), 2150036 (2021)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-20350-3_1","volume-title":"Theory and Applications of Models of Computation","author":"Y Sun","year":"2022","unstructured":"Sun, Y., Liu, Y., Li, M.: Maximization of $$k$$-submodular function with a matroid constraint. In: Du, D.Z., Du, D., Wu, C., Xu, D. (eds.) TAMC 2022. LNCS, vol. 13571, pp. 1\u201310. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20350-3_1"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2022.04.003","volume":"921","author":"Z Tang","year":"2022","unstructured":"Tang, Z., Wang, C., Chan, H.: Monotone $$k$$-submodular secretary problems: cardinality and knapsack constraints. Theor. Comput. Sci. 921, 86\u201399 (2022)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"24_CR16","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.orl.2021.11.010","volume":"50","author":"Z Tang","year":"2022","unstructured":"Tang, Z., Wang, C., Chan, H.: On maximizing a monotone $$k$$-submodular function under a knapsack constraint. Oper. Res. Lett. 50(1), 28\u201331 (2022)","journal-title":"Oper. Res. Lett."},{"key":"24_CR17","unstructured":"Wang, B., Zhou, H.: Multilinear extension of $$k$$-submodular functions. arXiv:2107.07103 (2021)"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Ward, J., \u017divn\u00fd, S.: Maximizing $$k$$-submodular functions and beyond. ACM Trans. Algorithms 12(4), 1\u201326 (2016). Article 47","DOI":"10.1145\/2850419"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Zheng, L., Chan, H., Loukides, G., Li, M.: Maximizing approximately $$k$$-submodular functions. In: Proceeding of SDM, pp. 414\u2013422 (2021)","DOI":"10.1137\/1.9781611976700.47"}],"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-031-26303-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,2]],"date-time":"2023-08-02T13:05:00Z","timestamp":1690981500000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26303-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031263026","9783031263033"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26303-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 February 2023","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2022","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":"csonet2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csonet-conf.github.io\/csonet22\/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":"47","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":"17","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":"7","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":"36% - 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":"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":"5","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)"}}]}}