{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T01:56:37Z","timestamp":1768442197943,"version":"3.49.0"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T00:00:00Z","timestamp":1245369600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s10589-009-9269-y","type":"journal-article","created":{"date-parts":[[2009,6,18]],"date-time":"2009-06-18T15:47:27Z","timestamp":1245340047000},"page":"463-474","source":"Crossref","is-referenced-by-count":70,"title":["Greedy approximations for minimum submodular cover with submodular cost"],"prefix":"10.1007","volume":"45","author":[{"given":"Peng-Jun","family":"Wan","sequence":"first","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]},{"given":"Panos","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,6,19]]},"reference":[{"key":"9269_CR1","unstructured":"Baudis, G., Gr\u00f6pl, C., Hougardy, S., Nierhoff, T., Pr\u00f6mel, H.J.: Approximating minimum spanning sets in hypergraphs and polymatroids. Technical Report, Humboldt-Universitt zu Berlin (2000)"},{"key":"9269_CR2","first-page":"114","volume-title":"Lectures Notes in Computer Science","author":"G. Calinescu","year":"2003","unstructured":"Calinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad hoc wireless networks. In: Lectures Notes in Computer Science, vol. 2832, pp. 114\u2013126. Springer, Berlin (2003)"},{"key":"9269_CR3","doi-asserted-by":"crossref","unstructured":"Feige, U.: A threshold of ln\u2009n for approximating set cover. In: Proc. the Twenty-Eighth Annual ACM Symp. Theory of Computing, pp.\u00a0314\u2013318 (1996)","DOI":"10.1145\/237814.237977"},{"issue":"3","key":"9269_CR4","first-page":"480","volume":"E83-D","author":"T. Fujito","year":"2000","unstructured":"Fujito, T.: Approximation algorithms for submodular set cover with application. IEICE Trans. Inf. Syst. E83-D(3), 480\u2013487 (2000)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"9269_CR5","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1999","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1999)"},{"issue":"4","key":"9269_CR6","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"L.A. Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for submodular set covering problem. Combinatorica 2(4), 385\u2013393 (1982)","journal-title":"Combinatorica"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9269-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-009-9269-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9269-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:36Z","timestamp":1559288196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-009-9269-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,19]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["9269"],"URL":"https:\/\/doi.org\/10.1007\/s10589-009-9269-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,19]]}}}