{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:36:54Z","timestamp":1743089814844,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"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-92681-6_29","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"364-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximization of\u00a0Monotone Non-submodular Functions with\u00a0a\u00a0Knapsack Constraint over\u00a0the\u00a0Integer Lattice"],"prefix":"10.1007","author":[{"given":"Jingjing","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fengmin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoqing","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gollapudi, S., Halverson, A., Ieong, S. Diversifying search results. In: Proceedings of WSDM, pp. 5\u201314 (2009)","DOI":"10.1145\/1498759.1498766"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Gamzu, I., Tennenholtz, M.: Optimizing budget allocation among channels and influencers. In: Proceedings of WWW, pp. 381\u2013388 (2012)","DOI":"10.1145\/2187836.2187888"},{"key":"29_CR3","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":"29_CR4","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Schwartz, R.: Online submodular maximization with preemption. In: Proceedings of SODA, pp. 1202\u20131216 (2015)","DOI":"10.1137\/1.9781611973730.80"},{"key":"29_CR5","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":"29_CR6","doi-asserted-by":"crossref","unstructured":"C$$\\breve{\\rm a}$$linescu, G., Chekuri, C., P$$\\acute{\\rm a}$$l, M., Vondr$$\\acute{\\rm a}$$k, J.: Maximizing a submodular set function subject to a matroid constraint. SIAM J. Comput. 40, 1740\u20131766 (2011)","DOI":"10.1137\/080733991"},{"issue":"1","key":"29_CR7","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(1), 225\u2013247 (2015). https:\/\/doi.org\/10.1007\/s10107-015-0900-7","journal-title":"Math. Program."},{"key":"29_CR8","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":"29_CR9","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Quanrud, K.: Randomize MWU for positive LPs. In: Proceedings of SODA, pp. 358\u2013377 (2018)","DOI":"10.1137\/1.9781611975031.25"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Das, A., Kempe, D.: Algorithms for subset selection in linear regression. In: Proceedings of STOC, pp. 45\u201354 (2008)","DOI":"10.1145\/1374376.1374384"},{"key":"29_CR11","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":"29_CR12","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":"29_CR13","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"},{"key":"29_CR14","first-page":"427","volume":"42","author":"D Golovin","year":"2011","unstructured":"Golovin, D., Krause, A.: Adaptive submodularity: theory and applications in active learning and stochastic optimization. J. Artif. Intell. Res. 42, 427\u2013486 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"29_CR15","first-page":"36","volume":"8","author":"RM Gomez","year":"2018","unstructured":"Gomez, R.M., Leskovec, J., Krause, A.: Inferring networks of diffusion and influence. ACM Trans. Knowl. Discov. Data 8, 36\u201339 (2018)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"3","key":"29_CR16","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":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-030-24766-9_32","volume-title":"Algorithms and Data Structures","author":"C-C Huang","year":"2019","unstructured":"Huang, C.-C., Kakimura, N.: Improved streaming algorithms for maximizing monotone submodular functions under a Knapsack constraint. In: Friggstad, Z., Sack, J.-R., Salavatipour, M.R. (eds.) WADS 2019. LNCS, vol. 11646, pp. 438\u2013451. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24766-9_32"},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1007\/s11590-019-01430-z","volume":"14","author":"YJ 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)","journal-title":"Optim. Lett."},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1061\/(ASCE)0733-9496(2008)134:6(516)","volume":"134","author":"A Krause","year":"2008","unstructured":"Krause, A., Leskovec, J., Guestrin, C., VanBriesen, J.M., Faloutsos, C.: Efficient sensor placement optimization for securing large water distribution networks. J. Water Resour. Plan. Manag. 134, 516\u2013526 (2008)","journal-title":"J. Water Resour. Plan. Manag."},{"key":"29_CR20","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, 235\u2013284 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Kapralov, M., Post, I., Vondr$$\\acute{\\rm a}$$k, J.: Online submodular welfare maximization: greedy is optimal. In: Proceedings of SODA, pp. 1216\u20131225 (2012)","DOI":"10.1137\/1.9781611973105.88"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"29_CR23","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":"29_CR24","unstructured":"Kuhnle, A., Smith, J.D., Crawford, V.G., Thai, M.T.: Fast maximization of non-submodular, monotonic functions on the integer lattice. In: Proceedings of ICML, pp. 2791\u20132800 (2018)"},{"key":"29_CR25","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"29_CR26","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":"29_CR27","doi-asserted-by":"crossref","unstructured":"Simon, I., Snavely, N., Seitz, S.M.: Scene summarization for online image collections. In: Proceedings of ICCV, pp. 1\u20138 (2007)","DOI":"10.1109\/ICCV.2007.4408863"},{"key":"29_CR28","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, 41\u201343 (2004)","journal-title":"Oper. Res. Lett."},{"key":"29_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793830909000063","volume":"1","author":"A Shioura","year":"2009","unstructured":"Shioura, A.: On the pipage rounding algorithm for submodular function maximization-a view from discrete convex analysis. Discrete Math. Algorithms Appl. 1, 1\u201323 (2009)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"29_CR30","unstructured":"Soma, T., Kakimura, N., Inaba, K., Kawarabayashi, K.: Optimal budget allocation: theoretical guarantee and efficient algorithm. In: Proceedings of ICML, pp. 351\u2013359 (2014)"},{"key":"29_CR31","unstructured":"Soma, T., Yoshida, Y.: A generalization of submodular cover via the diminishing return property on the integer lattice. In: Proceedings of NIPS, pp. 847\u2013855 (2014)"},{"key":"29_CR32","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)","journal-title":"Math. Program."},{"key":"29_CR33","doi-asserted-by":"crossref","unstructured":"Vondr$$\\check{\\rm a}$$k, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: Proceedings of STOC, pp. 67\u201374 (2008)","DOI":"10.1145\/1374376.1374389"},{"key":"29_CR34","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."},{"issue":"4","key":"29_CR35","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10898-019-00840-8","volume":"76","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Xu, D., Wang, Y., Zhang, D.: Non-submodular maximization on massive data streams. J. Glob. Optim. 76(4), 729\u2013743 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00840-8","journal-title":"J. Glob. Optim."},{"key":"29_CR36","first-page":"195","volume":"36","author":"RQ Yang","year":"2019","unstructured":"Yang, R.Q., Xu, D.C., Jiang, Y.J., Wang, Y.S., Zhang, D.M.: Approximation robust parameterized submodular function maximization in large-scales. Asia Pac. J. Oper. Res. 36, 195\u2013220 (2019)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"29_CR37","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10898-021-01014-1","volume":"80","author":"ZN Zhang","year":"2021","unstructured":"Zhang, Z.N., Du, D.L., Jiang, Y.J., Wu, C.C.: Maximizing DR-submodular + supermodular function on the integer lattice subject to a cardinality constraint. J. Glob. Optim. 80, 595\u2013616 (2021)","journal-title":"J. Glob. Optim."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:06:46Z","timestamp":1639354006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_29","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":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"16","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":"26% - 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":"4.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":"2.75","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)"}}]}}