{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:13:38Z","timestamp":1762272818213,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,8,2]],"date-time":"2021-08-02T00:00:00Z","timestamp":1627862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,2]],"date-time":"2021-08-02T00:00:00Z","timestamp":1627862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-17-1-2296","N00014-18-W-X00709"],"award-info":[{"award-number":["N00014-17-1-2296","N00014-18-W-X00709"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["314838170"],"award-info":[{"award-number":["314838170"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10898-021-01063-6","type":"journal-article","created":{"date-parts":[[2021,8,2]],"date-time":"2021-08-02T05:02:49Z","timestamp":1627880569000},"page":"179-194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Maximization problems of balancing submodular relevance and supermodular diversity"],"prefix":"10.1007","volume":"82","author":[{"given":"Zhicheng","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2224-1484","authenticated-orcid":false,"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,2]]},"reference":[{"unstructured":"Abbasi, Z.S., Ghadiri, M.: Max-sum diversification, montone submodular functions, and semi-metric spaces. CoRR (2015). (abs\/1511.02402)","key":"1063_CR1"},{"unstructured":"Bai, W., Bilmes, J.A.: Greed is Still Good: Maximizing monotone Submodular+Supermodular (BP) functions. ICML 304\u2013313 (2018)","key":"1063_CR2"},{"issue":"3","key":"1063_CR3","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s00453-001-0022-x","volume":"30","author":"C Baur","year":"2001","unstructured":"Baur, C., Fekete, S.P.: Approximation of geometric dispersion problems. Algorithmica 30(3), 451\u2013470 (2001)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., Gollapudi, S., Munagala, K.: Consideration set generation in commerce search. WWW 317\u2013326(2011)","key":"1063_CR4","DOI":"10.1145\/1963405.1963452"},{"issue":"1","key":"1063_CR5","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/s00453-007-9142-2","volume":"55","author":"B Birnbaum","year":"2009","unstructured":"Birnbaum, B., Goldman, K.J.: An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs. Algorithmica 55(1), 42\u201359 (2009)","journal-title":"Algorithmica"},{"unstructured":"Bilmes, J., Bai, W.: Deep Submodular Functions. arXiv:1701.08939 (2017)","key":"1063_CR6"},{"doi-asserted-by":"crossref","unstructured":"Borodin, A., Jain, A., Lee, H.C., Ye, Y.: Max-sum diversification, monotone submodular functions and dynamic updates. ACM Trans. Algorithms 13(3), 41:1-41:25 (2017)","key":"1063_CR7","DOI":"10.1145\/3086464"},{"issue":"5","key":"1063_CR8","first-page":"469","volume":"10","author":"M Ceccarello","year":"2017","unstructured":"Ceccarello, M., Pietracaprina, A., Pucci, G., Upfal, E.: MapReduce and streaming algorithms for diversity maximization in metric spaces of bounded doubling dimension. PVLDB 10(5), 469\u2013480 (2017)","journal-title":"PVLDB"},{"doi-asserted-by":"crossref","unstructured":"Cevallos, A., Eisenbrand, F., Zenklusen, R.: Local search formax-sum diversification. SODA 130\u2013142(2017)","key":"1063_CR9","DOI":"10.1137\/1.9781611974782.9"},{"unstructured":"Chen, W., Chen, y., Weinberger, K. Q.: Filtered search for submodular maximization with controllable approximation bounds. AISTATS, 156-164 (2015)","key":"1063_CR10"},{"issue":"3","key":"1063_CR11","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. Discr. Appl. Math. 7(3), 251\u2013274 (1984)","journal-title":"Discr. Appl. Math."},{"unstructured":"Ghadiri, M., Schmidt, M.:Distributed maximization of \u201cSubmodular plus Diversity\u201d functions formulti-label feature selection on huge datasets. AISTATS 2077\u20132086 (2019)","key":"1063_CR12"},{"issue":"1","key":"1063_CR13","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."},{"issue":"11","key":"1063_CR14","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1287\/mnsc.45.11.1539","volume":"45","author":"B Goldengorin","year":"1999","unstructured":"Goldengorin, B., Sierksma, G., Tijssen, G.A., Tso, M.: The data-correcting algorithm for the minimization of supermodular functions. Manag. Sci. 45(11), 1539\u20131551 (1999)","journal-title":"Manag. Sci."},{"doi-asserted-by":"crossref","unstructured":"Gollapudi, S., Sharma, A.: An axiomatic approach for result diversification. WWW 381\u2013390(2009)","key":"1063_CR15","DOI":"10.1145\/1526709.1526761"},{"issue":"3","key":"1063_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)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"1063_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0167-6377(97)00034-5","volume":"21","author":"R Hassin","year":"1997","unstructured":"Hassin, R., Rubinstein, S., Tamir, A.: Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21(3), 133\u2013137 (1997)","journal-title":"Oper. Res. Lett."},{"doi-asserted-by":"crossref","unstructured":"Indyk, P., Mahabadi, S., Mahdian, M., Mirrokni, V.S.: Composable core-sets for diversity and coverage maximization. PODS 100\u2013108 (2014)","key":"1063_CR18","DOI":"10.1145\/2594538.2594560"},{"doi-asserted-by":"crossref","unstructured":"Krause, A., Golovin, D.: Submodular function maximization. Tractability, 71\u2013104 (2014). http:\/\/www.cs.cmu.edu\/dgolovin\/papers\/submodularsurvey12.pdf","key":"1063_CR19","DOI":"10.1017\/CBO9781139177801.004"},{"issue":"4","key":"1063_CR20","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1137\/090750020","volume":"23","author":"J Lee","year":"2010","unstructured":"Lee, J., Mirrokni, V.S., Nagarajan, V., Sviridenko, M.: Maximizing nonmonotone submodular functions under matroid or knapsack constraints. SIAM J. Discr. Math. 23(4), 2053\u20132078 (2010)","journal-title":"SIAM J. Discr. Math."},{"issue":"1","key":"1063_CR21","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.amc.2006.11.090","volume":"189","author":"G Palubeckis","year":"2007","unstructured":"Palubeckis, G.: Iterated tabu search for the maximum diversity problem. Appl. Math. Comput. 189(1), 371\u2013383 (2007)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"1063_CR22","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1287\/opre.42.2.299","volume":"42","author":"SS Ravi","year":"1994","unstructured":"Ravi, S.S., Rosenkrantz, D.J., Tayi, G.K.: Heuristic and special case algorithms for dispersion problems. Oper. Res. 42(2), 299\u2013310 (1994)","journal-title":"Oper. Res."},{"issue":"4","key":"1063_CR23","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."},{"unstructured":"Ward, J.: Oblivious and non-oblivious local search for combinatorial optimization. PhD thesis, University of Toronto (2012)","key":"1063_CR24"},{"issue":"2","key":"1063_CR25","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.ejor.2013.06.002","volume":"231","author":"Q Wu","year":"2013","unstructured":"Wu, Q., Hao, J.: A hybrid metaheuristic method for the maximum diversity problem. Eur. J. Oper. Res. 231(2), 452\u2013464 (2013)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01063-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01063-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01063-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T19:28:49Z","timestamp":1699298929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01063-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,2]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1063"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01063-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,8,2]]},"assertion":[{"value":"6 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}