{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:42:50Z","timestamp":1767339770467,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T00:00:00Z","timestamp":1616716800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T00:00:00Z","timestamp":1616716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871081","12001025"],"award-info":[{"award-number":["11871081","12001025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Program of Beijing Education Commission","award":["KM201810005006"],"award-info":[{"award-number":["KM201810005006"]}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["283106"],"award-info":[{"award-number":["283106"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771386","11728104"],"award-info":[{"award-number":["11771386","11728104"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801251","11971349"],"award-info":[{"award-number":["11801251","11971349"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10898-021-01014-1","type":"journal-article","created":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T02:02:36Z","timestamp":1616724156000},"page":"595-616","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint"],"prefix":"10.1007","volume":"80","author":[{"given":"Zhenning","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[]},{"given":"Yanjun","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Chenchen","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,26]]},"reference":[{"key":"1014_CR1","unstructured":"Bai, W., Bilmes, J.: Greed is still good: Maximizing monotone submodular+supermodular (BP) functions. In: Proceedings of ICML, pp. 304\u2013313 (2018)"},{"key":"1014_CR2","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)"},{"key":"1014_CR3","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, 1740\u20131766 (2011)","journal-title":"SIAM J. Comput."},{"key":"1014_CR4","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 Rado-Edmonds theorem. Discrete Appl. Math. 7, 251\u2013274 (1984)","journal-title":"Discrete Appl. Math."},{"key":"1014_CR5","unstructured":"Das, A., Kempe, D.: Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection. In: Proceedings of ICML, 1057\u20131064 (2011)"},{"key":"1014_CR6","unstructured":"Ene, A., Nguyen, H. L.: A reduction for optimizing lattice submodular functions with diminishing returns. ArXiv:1606.08362v2 (2018)"},{"issue":"1","key":"1014_CR7","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.ejor.2008.08.022","volume":"198","author":"B Goldengorin","year":"2009","unstructured":"Goldengorin, B.: Maximization of submodular functions: Theory and enumeration algorithms. Eur. J. Oper. Res. 198(1), 102\u2013112 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"1014_CR8","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of SIGKDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"1014_CR9","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, 235\u2013284 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"1014_CR10","unstructured":"Kuhnle, A., Smith, J., Crawford, V., Thai, M.: Fast maximization of non-submodular, monotonic functions on the integer lattice. In: Proceedings of ICML, 2791\u20132800 (2018)"},{"key":"1014_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/moor.3.3.177","volume":"3","author":"G Nemhauser","year":"1978","unstructured":"Nemhauser, G., Wolsey, L.: Best algorithms for approximating the maximum of a submodular set function. Math. Oper. Res. 3, 177\u2013188 (1978)","journal-title":"Math. Oper. Res."},{"key":"1014_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G Nemhauser","year":"1978","unstructured":"Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"1014_CR13","unstructured":"Qian, C., Zhang, Y., Tang, K., Yao, X.: On multiset selection with size constraints. In: Proceedings of AAAI, 1395\u20131402 (2018)"},{"key":"1014_CR14","unstructured":"Soma, T., Kakimura, N., Inaba, K., Kawarabayashi K.: Optimal budget allocation: Theoretical guarantee and efficient algorithm. In: Proceedings of ICML, 351\u2013359 (2014)"},{"key":"1014_CR15","unstructured":"Soma, T., Yoshida, Y.: A generalization of submodular cover via the diminishing return property on the integer lattice. In: Proceedings of NIPS, 847\u2013855 (2015)"},{"key":"1014_CR16","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.: Maximizing monotone submodular functions over the integer lattice. Math. Program. 172, 539\u2013563 (2018)","journal-title":"Math. Program."},{"key":"1014_CR17","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, 1197\u20131218 (2017)","journal-title":"Math. Oper. Res."},{"key":"1014_CR18","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":"1014_CR19","doi-asserted-by":"crossref","unstructured":"Vondr\u00e1k, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: Proceedings of STOC, 67\u201374 (2008)","DOI":"10.1145\/1374376.1374389"},{"key":"1014_CR20","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 J. Discrete Math. 33, 1452\u20131471 (2019)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01014-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01014-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01014-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T06:17:30Z","timestamp":1625638650000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01014-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,26]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1014"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01014-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,3,26]]},"assertion":[{"value":"7 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}