{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:25:17Z","timestamp":1762032317239},"reference-count":12,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0020-0190(93)90173-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"305-310","source":"Crossref","is-referenced-by-count":35,"title":["A modified greedy heuristic for the Set Covering problem with improved worst case bound"],"prefix":"10.1016","volume":"48","author":[{"given":"Olivier","family":"Goldschmidt","sequence":"first","affiliation":[]},{"given":"Dorit S.","family":"Hochbaum","sequence":"additional","affiliation":[]},{"given":"Gang","family":"Yu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(93)90173-7_BIB1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","article-title":"A greedy heuristic for the set-covering problem","volume":"4","author":"Chv\u00e1tal","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0020-0190(93)90173-7_BIB2","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(93)90173-7_BIB3","series-title":"Tech. Rept., Dept. of IE&OR","article-title":"Components assembly in the semiconductor industry: A study of packing in graphs and hypergraphs","author":"Goldschmidt","year":"1992"},{"key":"10.1016\/0020-0190(93)90173-7_BIB4_1","article-title":"Approximation algorithms for the weighted set covering and node cover problems","author":"Hochbaum","year":"1980","journal-title":"GSIA Working Paper No. 64-79-80"},{"issue":"3","key":"10.1016\/0020-0190(93)90173-7_BIB4_2","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"Hochbaum","year":"1982","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0020-0190(93)90173-7_BIB5","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/0210054","article-title":"The NP-completeness of some edge-partition problems","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(93)90173-7_BIB6","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":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(93)90173-7_BIB7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","article-title":"On the complexity of combinatorial problems","volume":"5","author":"Karp","year":"1972","journal-title":"Networks"},{"key":"10.1016\/0020-0190(93)90173-7_BIB8","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0020-0190(93)90173-7_BIB9","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":"Lov\u00e0sz","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0020-0190(93)90173-7_BIB10","author":"Lund","year":"1992","journal-title":"On the hardness of approximating minimization problems"},{"key":"10.1016\/0020-0190(93)90173-7_BIB11","first-page":"17","article-title":"An O(\u221a|V||E|) algorithm for maximum matching in general graphs","author":"Micali","year":"1980","journal-title":"Proc. 21st IEEE Ann. Symp. on the Foundations of Computer Science"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093901737?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093901737?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T05:38:34Z","timestamp":1580881114000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019093901737"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["0020019093901737"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90173-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}