{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:12Z","timestamp":1740122412196,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11871280","12101314"],"award-info":[{"award-number":["11871280","12101314"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20200723"],"award-info":[{"award-number":["BK20200723"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jiangsu Province Higher Education Foundation","award":["20KJB110022"],"award-info":[{"award-number":["20KJB110022"]}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["12131003","12271259"],"award-info":[{"award-number":["12131003","12271259"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10878-023-01001-0","type":"journal-article","created":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T11:03:23Z","timestamp":1678359803000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two-stage submodular maximization under curvature"],"prefix":"10.1007","volume":"45","author":[{"given":"Yanzhi","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhicheng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuchu","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0828-5189","authenticated-orcid":false,"given":"Hong","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,9]]},"reference":[{"key":"1001_CR1","unstructured":"Balkanski E, Krause A, Mirzasoleiman B, Singer Y (2016) Learning sparse combinatorial representations via two-stage submodular maximization. In ICML, pp 2207\u20132216"},{"issue":"3","key":"1001_CR2","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, Cornuejols G (1984) 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","journal-title":"Discr Appl Math"},{"key":"1001_CR3","doi-asserted-by":"crossref","unstructured":"Fisher M L, Nemhauser G L, Wolsey L A (1978) An analysis of approximations for maximizing submodular set functions\u2013ii. Polyhedral combinatorics, pp 73\u201387","DOI":"10.1007\/BFb0121195"},{"key":"1001_CR4","doi-asserted-by":"crossref","unstructured":"Feldman M, Naor J, Schwartz R, Ward J (2011) Improved approximations for k-exchange systems. In: Proceedings of ESA, pp 784\u2013798","DOI":"10.1007\/978-3-642-23719-5_66"},{"key":"1001_CR5","unstructured":"Krause A, Guestrin A (2005) Near-optimal nonmyopic value of information in graphical models. In UAI, 5"},{"issue":"4","key":"1001_CR6","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1137\/090750020","volume":"23","author":"J Lee","year":"2010","unstructured":"Lee J, Mirrokni VS, Nagarajan V, Sviridenko M (2010) Maximizing nonmonotone submodular functions under matroid or knapsack constraints. SIAM J Discr Math 23(4):2053\u20132078","journal-title":"SIAM J Discr Math"},{"key":"1001_CR7","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s11590-016-1039-z","volume":"11","author":"J Laitila","year":"2017","unstructured":"Laitila J, Moilanen A (2017) New performance guarantees for the greedy maximization of submodular set functions. Optim Lett 11:655\u2013665","journal-title":"Optim Lett"},{"key":"1001_CR8","unstructured":"Mitrovic M, Kazemi E, Zadimoghaddam M, Karbasi A (2018) Data summarization at scale: a two-stage submodular approach. In ICML, pp 3593\u20133602"},{"issue":"1","key":"1001_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions-i. Math Program 14(1):265\u2013294","journal-title":"Math Program"},{"issue":"2","key":"1001_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.disopt.2013.02.002","volume":"10","author":"AS Schulz","year":"2013","unstructured":"Schulz AS, Uhan NA (2013) Approximating the least core value and least core of cooperative games with supermodular costs. Discr Optim 10(2):163\u2013180","journal-title":"Discr Optim"},{"key":"1001_CR11","unstructured":"Stan S, Zadimoghaddam M, Krause A, Karbasi A (2017) Probabilistic submodular maximization in sub-linear time. In ICML, pp 3241\u20133250"},{"key":"1001_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2020.05.024","volume":"853","author":"R Yang","year":"2021","unstructured":"Yang R, Gu S, Gao C, Wu W, Wang H, Xu D (2021) A constrained two-stage submodular maximization. Theor Comput Sci 853:57\u201364","journal-title":"Theor Comput Sci"},{"key":"1001_CR13","unstructured":"Zhou M, Chen H, Ren L, Sapiro G, Carin L, Paisley JW (2009) Non-parametric bayesian dictionary learning for sparse image representations. In NIPS, pp 2295\u20132303"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01001-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01001-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01001-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T11:36:01Z","timestamp":1678361761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01001-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1001"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01001-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2023,3]]},"assertion":[{"value":"14 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"77"}}