{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T11:40:56Z","timestamp":1772970056488,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1982,12]]},"DOI":"10.1007\/bf02579435","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T17:17:02Z","timestamp":1174583822000},"page":"385-393","source":"Crossref","is-referenced-by-count":357,"title":["An analysis of the greedy algorithm for the submodular set covering problem"],"prefix":"10.1007","volume":"2","author":[{"given":"L. A.","family":"Wolsey","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"BF02579435_CR1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chvatal","year":"1979","unstructured":"V. Chvatal, Greedy Heuristics for the Set-Covering Problem,Math. of Oper. Res. 4 (3), (1979), 233\u2013235.","journal-title":"Math. of Oper. Res."},{"key":"BF02579435_CR2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1137\/0601030","volume":"1","author":"G. Cornu\u00e9jols","year":"1980","unstructured":"G. Cornu\u00e9jols, G. L. Nemhauser andL. A. Wolsey, A Canonical Representation of Simple Plant Location Problems and Its Applications,SIAM J. Alg. Disc. Math. 1, (1980), 261\u2013272.","journal-title":"SIAM J. Alg. Disc. Math."},{"key":"BF02579435_CR3","unstructured":"G. Dobson, Worst Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data,Technical Report SOL 80-25, Stanford, October 1980."},{"key":"BF02579435_CR4","unstructured":"M. L. Fisher andL. A. Wolsey, On the Greedy Heuristic for Covering and Packing Problems,CORE, DP 8124, Louvain-la-Neuve, May 1981."},{"key":"BF02579435_CR5","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. S. Johnson","year":"1974","unstructured":"D. S. Johnson, Approximation Algorithms for Combinatorial problems,J. Comput. System Sci. 9, (1974), 256\u2013298.","journal-title":"J. Comput. System Sci."},{"key":"BF02579435_CR6","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"L. Lov\u00e1sz. On the Ratio of Optimal Integral and Fractional Covers,Discrete Math.,13, (1975), 383\u2013390.","journal-title":"Discrete Math."},{"key":"BF02579435_CR7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G. L. Nemhauser","year":"1978","unstructured":"G. L. Nemhauser, L. A. Wolsey andM. L. Fisher, An Analysis of Approximations for Maximizing Submodular Set Functions \u2014 I.Math. Prog.,14 (1978), 265\u2013294.","journal-title":"Math. Prog."},{"key":"BF02579435_CR8","unstructured":"G. L. Nemhauser andL. A. Wolsey, Maximising Submodular Set Functions: Formulations and Analysis of Algorithms,CORE, DP 7832, Louvain La-Neuve, August 1978, to appear in Ann. of. Disc. Math."},{"key":"BF02579435_CR9","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1112\/plms\/s3-7.1.300","volume":"7","author":"R. Rado","year":"1957","unstructured":"R. Rado, Note on Independence Functions,Proc. London Math. Soc.,7, (1957), 300\u2013320.","journal-title":"Proc. London Math. Soc."},{"key":"BF02579435_CR10","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1287\/moor.7.3.410","volume":"7","author":"L. A. Wolsey","year":"1982","unstructured":"L. A. Wolsey, Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems,Math. of Oper. Res. 7, (1982), 410\u2013425,","journal-title":"Math. of Oper. Res."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579435.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579435\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:45:04Z","timestamp":1558183504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["BF02579435"],"URL":"https:\/\/doi.org\/10.1007\/bf02579435","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}