{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T11:42:34Z","timestamp":1692704554430},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3803,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s1571-0661(04)80716-3","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"174-185","source":"Crossref","is-referenced-by-count":8,"title":["Greedy Algorithm for Set Cover in Context of Knowledge Discovery Problems"],"prefix":"10.1016","volume":"82","author":[{"given":"Mikhail Ju.","family":"Moshkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80716-3_NEWBIB1","series-title":"\u201cClassification and Regression Trees,\u201d","author":"Breiman","year":"1984"},{"key":"10.1016\/S1571-0661(04)80716-3_NEWBIB2","doi-asserted-by":"crossref","unstructured":"Feige U., A threshold of In n for approximating set cover (Preliminary version), \u201cProceedings of 28th Annual ACM Symposium on the Theory of Computing,\u201d ACM Press, New York (1996), 314\u2013318.","DOI":"10.1145\/237814.237977"},{"key":"10.1016\/S1571-0661(04)80716-3_NEWBIB3","series-title":"\u201cComputers and Intractability: A Guide to the Theory of NP-Completeness,\u201d","author":"Garey","year":"1979"},{"key":"10.1016\/S1571-0661(04)80716-3_NEWBIB4","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1571-0661(04)80716-3_NEWBIB5","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","article-title":"On the ratio of optimal integral and fractional covers","volume":"13","author":"Lovasz","year":"1975","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S1571-0661(04)80716-3_NEWBIB6","unstructured":"Nigmatullin, R. G., Method of steepest descent in problems on cover, \u201cMemoirs of Symposium Problems of Precision and Efficiency of Computing Algorithms\u201d 5, Kiev (1969), 116\u2013126 (in Russian)."},{"key":"10.1016\/S1571-0661(04)80716-3_NEWBIB7","series-title":"Studies in Fuzziness and Soft Computing 18","first-page":"10","article-title":"Rough set elements, \u201cRough Sets in Knowledge Discovery 1. Methodology and Applications\u201d","author":"Pawlak","year":"1998"},{"key":"10.1016\/S1571-0661(04)80716-3_NEWBIB8","doi-asserted-by":"crossref","unstructured":"Slav\u00edk, P., A tight analysis of the greedy algorithm for set cover, \u201cProceedings of 28th Annual ACM Symposium on the Theory of Computing,\u201d ACM Press, New York (1996), 435\u2013439.","DOI":"10.1145\/237814.237991"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807163?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104807163?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T05:53:34Z","timestamp":1549173214000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104807163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S1571066104807163"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80716-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}