{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T07:22:07Z","timestamp":1721632927075},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1016\/j.orl.2004.03.010","type":"journal-article","created":{"date-parts":[[2004,8,31]],"date-time":"2004-08-31T13:27:50Z","timestamp":1093958870000},"page":"210-215","source":"Crossref","is-referenced-by-count":2,"title":["Combinatorial approximation algorithms: a comparative review"],"prefix":"10.1016","volume":"33","author":[{"given":"Gerhard J.","family":"Woeginger","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2004.03.010_bib1","series-title":"Parameterized Complexity","author":"Downey","year":"1999"},{"key":"10.1016\/j.orl.2004.03.010_bib2","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","article-title":"A threshold of lnn for approximating set cover","volume":"45","author":"Feige","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/j.orl.2004.03.010_bib3","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/j.orl.2004.03.010_bib4","doi-asserted-by":"crossref","unstructured":"V. Guruswami, D. Lewin, M. Sudan, L. Trevisan, A tight characterization of NP with 3-query PCPs, Proceedings of the 39th IEEE Symposium on Foundations of Computer Science FOCS, 1998, pp. 18\u201327","DOI":"10.1109\/SFCS.1998.743424"},{"key":"10.1016\/j.orl.2004.03.010_bib5","doi-asserted-by":"crossref","unstructured":"P. Slavik, A tight analysis of the greedy algorithm for set cover, Proceedings of the 28th Annual ACM Symposium on the Theory of Computing STOC, 1996, pp. 435\u2013441","DOI":"10.1145\/237814.237991"},{"key":"10.1016\/j.orl.2004.03.010_bib6","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1287\/opre.45.2.288","article-title":"Short shop schedules","volume":"45","author":"Williamson","year":"1997","journal-title":"Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704000811?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704000811?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T10:20:39Z","timestamp":1549275639000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637704000811"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["S0167637704000811"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2004.03.010","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}