{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:06:59Z","timestamp":1762272419439,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030261757"},{"type":"electronic","value":"9783030261764"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-26176-4_54","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:10:29Z","timestamp":1563923429000},"page":"651-662","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Greedy Algorithm for Maximization of Non-submodular Functions Subject to Knapsack Constraint"],"prefix":"10.1007","author":[{"given":"Zhenning","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongmei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"key":"54_CR1","unstructured":"Balkanski, E., Singer, Y.: Approximation guarantees for adaptive sampling. In: Proceedings of the Thirty-Fifth International Conference on Machine Learning, pp. 384\u2013393 (2018)"},{"issue":"3","key":"54_CR2","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1287\/ijoc.2016.0742","volume":"29","author":"A Bettinelli","year":"2017","unstructured":"Bettinelli, A., Cacchiani, V., Malaguti, E.: A branch-and-bound algorithm for the knapsack problem with conflict graph. INFORMS J. Comput. 29(3), 457\u2013473 (2017)","journal-title":"INFORMS J. Comput."},{"key":"54_CR3","unstructured":"Bian, A., Levy, K.Y., Krause, A., Buhmann, J.M.: Non-monotone continuous DR-submodular maximization: structure and algorithms. In: Proceedings of the Thirty-First International Conference on Neural Information Processing Systems, pp. 486\u2013496 (2017)"},{"key":"54_CR4","unstructured":"Bian, A., Buhmann, J.M., Krause, A., Tschiatschek, S.: Guarantees for greedy maximization of non-submodular functions with applications. In: Proceedings of the Thirty-Fourth International Conference on Machine Learning, pp. 498\u2013507 (2017)"},{"issue":"6","key":"54_CR5","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a submodular set function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740\u20131766 (2011)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"54_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1214\/ss\/1177009939","volume":"10","author":"K Chaloner","year":"1995","unstructured":"Chaloner, K., Verdinelli, I.: Bayesian experimental design: a review. Stat. Sci. 10(3), 273\u2013304 (1995)","journal-title":"Stat. Sci."},{"issue":"3","key":"54_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti, M., Cornu\u00e9jols, G.: Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the radoedmonds theorem. Discrete Appl. Math. 7(3), 251\u2013274 (1984)","journal-title":"Discrete Appl. Math."},{"key":"54_CR8","unstructured":"Iyer, R., Bilmes, J.: Submodular optimization with submodular cover and submodular knapsack constraints. In: Proceedings of the Twenty-Sixth International Conference on Neural Information Processing Systems, pp. 2436\u20132444 (2013)"},{"key":"54_CR9","unstructured":"Iyer, R., Jegelka, S., Bilmes, J.: Curvature and optimal algorithms for learning and minimizing submodular functions. In: Proceedings of the Thirtieth International Conference on Machine Learning, pp. 2742\u20132750 (2013)"},{"issue":"Feb","key":"54_CR10","first-page":"235","volume":"9","author":"A Krause","year":"2008","unstructured":"Krause, A., Singh, A., Guestrin, C.: Nearoptimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies. J. Mach. Learn. Res. 9(Feb), 235\u2013284 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"54_CR11","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 the Thirty-Fifth International Conference on Machine Learning, pp. 2791\u20132800 (2018)"},{"issue":"1","key":"54_CR12","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-I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"54_CR13","doi-asserted-by":"crossref","unstructured":"Sakaue, S., Ishihata, M.: Accelerated best-first search with upper-bound computation for submodular function maximization. In: Proceedings of the Thirthy-Second AAAI Conference on Artificial Intelligence, pp. 1413\u20131421 (2018)","DOI":"10.1609\/aaai.v32i1.11521"},{"key":"54_CR14","doi-asserted-by":"crossref","unstructured":"Sakaue, S., Nishino, M., Yasuda, N.: Submodular function maximization over graphs via zero-suppressed binary decision diagrams. In: Proceedings of the Thirthy-Second AAAI Conference on Artificial Intelligence, pp. 1422\u20131430 (2018)","DOI":"10.1609\/aaai.v32i1.11520"},{"issue":"1","key":"54_CR15","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1287\/ijoc.2015.0660","volume":"28","author":"A Shioura","year":"2016","unstructured":"Shioura, A., Shakhlevich, N.V., Strusevich, V.A.: Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines. INFORMS J. Comput. 28(1), 148\u2013161 (2016)","journal-title":"INFORMS J. Comput."},{"key":"54_CR16","unstructured":"Soma, T., Yoshida, Y.: A generalization of submodular cover via the diminishing return property on the integer lattice. In: Proceedings of the Twenty-Eighth International Conference on Neural Information Processing Systems, pp. 847\u2013855 (2015)"},{"key":"54_CR17","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-319-33461-5_27","volume-title":"Integer Programming and Combinatorial Optimization","author":"Tasuku Soma","year":"2016","unstructured":"Soma, T., Yoshida, Y.: Maximizing monotone submodular functions over the integer lattice. In: Proceedings of the Nineteenth International Conference on Integer Programming and Combinatorial Optimization, pp. 325\u2013336 (2016)"},{"key":"54_CR18","doi-asserted-by":"crossref","unstructured":"Soma, T., Yoshida, Y.: Non-monotone DR-submodular function maximization. In: Proceedings of the Thirthy-First AAAI Conference on Artificial Intelligence, pp. 898\u2013904 (2017)","DOI":"10.1609\/aaai.v31i1.10653"},{"key":"54_CR19","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."},{"issue":"4","key":"54_CR20","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/moor.2016.0842","volume":"42","author":"M Sviridenko","year":"2017","unstructured":"Sviridenko, M., Vondr\u00e1k, J., Ward, J.: Optimal approximation for submodular and supermodular optimization with bounded curvature. Math. Oper. Res. 42(4), 1197\u20131218 (2017)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26176-4_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:15:25Z","timestamp":1709824525000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26176-4_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030261757","9783030261764"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26176-4_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictt.xidian.edu.cn\/COCOON2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}