{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T17:31:19Z","timestamp":1785605479901,"version":"3.56.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1981,6,1]],"date-time":"1981-06-01T00:00:00Z","timestamp":360201600000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1981,6]]},"DOI":"10.1016\/0196-6774(81)90020-1","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"198-203","source":"Crossref","is-referenced-by-count":314,"title":["A linear-time approximation algorithm for the weighted vertex cover problem"],"prefix":"10.1016","volume":"2","author":[{"given":"R","family":"Bar-Yehuda","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S","family":"Even","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(81)90020-1_BIB1","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0196-6774(81)90020-1_BIB2","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0196-6774(81)90020-1_BIB3","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"issue":"No. 3","key":"10.1016\/0196-6774(81)90020-1_BIB4","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. Operations Res."},{"key":"10.1016\/0196-6774(81)90020-1_BIB5","series-title":"Approximation algorithm for the weighted set covering and node cover problems","author":"Hochbaum","year":"1980"},{"issue":"No. 1","key":"10.1016\/0196-6774(81)90020-1_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(80)90002-4","article-title":"Khachiyan's linear programming algorithm","volume":"1","author":"Aspvall","year":"1980","journal-title":"J. Algorithms"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677481900201?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677481900201?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:52:35Z","timestamp":1548726755000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677481900201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["0196677481900201"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(81)90020-1","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}