{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:47Z","timestamp":1742914067450,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"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_8","type":"book-chapter","created":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:19:49Z","timestamp":1612829989000},"page":"81-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Nonsubmodular Maximization with Knapsack Constraint via Multilinear Extension"],"prefix":"10.1007","author":[{"given":"Jiachen","family":"Ju","sequence":"first","affiliation":[]},{"given":"Min","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Qian","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,7]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Badanidiyuru, A., Vondr$$\\rm {\\acute{a}}$$k, J.: Fast algorithms for maximizing submodular functions. In: Proceedings of SODA, pp. 1497\u20131514 (2013). https:\/\/doi.org\/10.1137\/1.9781611973402.110","DOI":"10.1137\/1.9781611973402.110"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Bian, A.A., Buhmann, J.M., Krause, A., Tschiatschek, S.: Guarantees for greedy maximization of non-submodular functions with applications. In: Proceedings of ICML, pp. 498\u2013507 (2017). https:\/\/doi.org\/10.5555\/3305381.3305433","DOI":"10.5555\/3305381.3305433"},{"key":"8_CR3","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":"8_CR4","unstructured":"Chekuri, C., Vondr$$\\rm {\\acute{a}}$$k, J., Zenkluse, R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. SIAM J. Comput. 43(6), 1831\u20131879 (2014)"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Ene, A., Nguy$$\\rm {\\tilde{\\hat{e}}}$$n, H.L.: A nearly-linear time algorithm for submodular maximization with a knapsack constraint. In: Proceedings of ICALP, pp. 53:1\u201353:12 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.53","DOI":"10.4230\/LIPIcs.ICALP.2019.53"},{"key":"8_CR6","unstructured":"Feldman, M.: Maximization problems with submodular objective functions. Ph.D. thesis, Computer Science Department, Technion (2013)"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01651330","volume":"22","author":"CM Fortuin","year":"1971","unstructured":"Fortuin, C.M., Kasteleyn, P.W.: Correlation inequalities on some partially ordered sets. Commun. Math. Phys. 22(2), 89\u2013103 (1971)","journal-title":"Commun. Math. Phys."},{"issue":"3","key":"8_CR8","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(3), 833\u2013849 (2019)","journal-title":"J. Global Optim."},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.46.1.17","volume":"46","author":"AJ Kleywegt","year":"1998","unstructured":"Kleywegt, A.J., Papastavrou, J.D.: The dynamic and stochastic knapsack problem. Oper. Res. 46(1), 17\u201335 (1998)","journal-title":"Oper. Res."},{"issue":"8","key":"8_CR10","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1057\/palgrave.jors.2601401","volume":"53","author":"R Mansini","year":"2002","unstructured":"Mansini, R., Speranza, M.G.: A multidimensional knapsack model for asset-backed securitization. J. Oper. Res. Soc. 53(8), 822\u2013832 (2002)","journal-title":"J. Oper. Res. Soc."},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Shamir, A.: A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem. In: Proceedings of SFCS, pp. 145\u2013152 (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.5","DOI":"10.1109\/SFCS.1982.5"},{"issue":"1","key":"8_CR12","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."},{"key":"8_CR13","unstructured":"Sviridenko, M., Vondr$$\\rm {\\acute{a}}$$k, J., Ward, J.: Optimal approximation for submodular and supermodular optimization with bounded curvature. Math. Oper. Res. 42(4), 1197\u20131218 (2017)"},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1137\/16M1107644","volume":"33","author":"Y Yoshida","year":"2019","unstructured":"Yoshida, Y.: Maximizing a monotone submodular function with a bounded curvature under a knapsack constraint. SIAM Discrete Math. 33(3), 1452\u20131471 (2019)","journal-title":"SIAM Discrete Math."},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/978-3-030-26176-4_54","volume-title":"Computing and Combinatorics","author":"Z Zhang","year":"2019","unstructured":"Zhang, Z., Liu, B., Wang, Y., Xu, D., Zhang, D.: Greedy algorithm for maximization of non-submodular functions subject to knapsack constraint. In: Du, D.-Z., Duan, Z., Tian, C. (eds.) COCOON 2019. LNCS, vol. 11653, pp. 651\u2013662. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26176-4_54"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/978-3-030-26176-4_54","volume-title":"Computing and Combinatorics","author":"Z Zhang","year":"2019","unstructured":"Zhang, Z., Liu, B., Wang, Y., Xu, D., Zhang, D.: Greedy algorithm for maximization of non-submodular functions subject to knapsack constraint. In: Du, D.-Z., Duan, Z., Tian, C. (eds.) COCOON 2019. LNCS, vol. 11653, pp. 651\u2013662. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26176-4_54"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T14:43:33Z","timestamp":1617288213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-16-0010-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811600098","9789811600104"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-0010-4_8","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)"}}]}}