{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:28:39Z","timestamp":1743096519440,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"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_7","type":"book-chapter","created":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T07:04:42Z","timestamp":1638515082000},"page":"68-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximizing the Sum of a Supermodular Function and a Monotone DR-submodular Function Subject to a Knapsack Constraint on the Integer Lattice"],"prefix":"10.1007","author":[{"given":"Jingjing","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yicheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongmei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoqing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,4]]},"reference":[{"key":"7_CR1","unstructured":"Bai, W., Bilmes, J.A.: Greed is still good: maximizing monotone submodular+supermodular functions. In: Proceedings of ICML, pp. 1\u201310 (2018)"},{"key":"7_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 KDD, pp. 671\u2013680 (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Schwartz, R.: Onling submodular maximization with preemption. In: Proceedings of SODA, pp. 1202\u20131216 (2015)","DOI":"10.1137\/1.9781611973730.80"},{"key":"7_CR4","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":"7_CR5","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., Pal, M., Vondrak, J.: Maximizing a momotone submodular function subject to a matroid constraint. SIAM J. Comput. 40, 1740\u20131766 (2011)","journal-title":"SIAM J. Comput."},{"key":"7_CR6","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). https:\/\/doi.org\/10.1007\/s10107-015-0900-7","journal-title":"Math. Program."},{"key":"7_CR7","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":"7_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":"7_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":"7_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":"7_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"},{"issue":"3","key":"7_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. Glob. Optim. 75(3), 833\u2013849 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00800-2","journal-title":"J. Glob. Optim."},{"key":"7_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"},{"key":"7_CR14","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-030-21803-4_49","volume-title":"Optimization of Complex Systems: Theory, Models, Algorithms and Applications","author":"S Ji","year":"2020","unstructured":"Ji, S., Xu, D., Li, M., Wang, Y., Zhang, D.: Stochastic greedy algorithm is still good: maximizing submodular + supermodular functions. In: Le Thi, H.A., Le, H.M., Pham Dinh, T. (eds.) WCGO 2019. AISC, vol. 991, pp. 488\u2013497. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-21803-4_49"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1007\/s11590-019-01430-z","volume":"14","author":"Y-J 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, 1235\u20131248 (2020). https:\/\/doi.org\/10.1007\/s11590-019-01430-z","journal-title":"Optim. Lett."},{"key":"7_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":"7_CR17","unstructured":"Norouzi-Fard, A., Tarnawski, J., Mitrovic, S., Zandieh, A., Mousavifar, A., Svensson, O.: Beyond $$1\/2$$-approximation for submodular maximization on massive data streams. In: Proceedings of ICML, pp. 3829\u20133838 (2018)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Sviridenko, M., Vondrak, J., Ward, J.: Optimal approximation for submodular and supermodular optimization with bounded curvature. In: Proceedings of SODA, pp. 1134\u20131148 (2015)","DOI":"10.1137\/1.9781611973730.76"},{"key":"7_CR19","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). https:\/\/doi.org\/10.1007\/s10107-018-1324-y","journal-title":"Math. Program."},{"key":"7_CR20","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, 410\u2013425 (1982)","journal-title":"Math. Oper. Res."},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10898-019-00840-8","volume":"76","author":"Y-J Wang","year":"2020","unstructured":"Wang, Y.-J., Xu, D.-C., Wang, Y.-S., Zhang, D.-M.: Non-submodular maximization on massive data streams. J. Glob. Optim. 76, 729\u2013743 (2020). https:\/\/doi.org\/10.1007\/s10898-019-00840-8","journal-title":"J. Glob. Optim."},{"key":"7_CR22","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"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-030-26176-4_51","volume-title":"Computing and Combinatorics","author":"R Yang","year":"2019","unstructured":"Yang, R., Xu, D., Du, D., Xu, Y., Yan, X.: Maximization of constrained non-submodular functions. In: Du, D.-Z., Duan, Z., Tian, C. (eds.) COCOON 2019. LNCS, vol. 11653, pp. 615\u2013626. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26176-4_51"},{"key":"7_CR24","unstructured":"Yu, Q.-L., Xu, E.-L., Cui, S.-G.: Streaming algorithms for news and scientific literature recommendation: submodular maximization with a d-knapsack constraint. In: Proceedings of IEEE GCSI (2016). https:\/\/arxiv.org\/abs\/1603.05614"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:40:39Z","timestamp":1710232839000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91434-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030914332","9783030914349"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91434-9_7","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)"}}]}}