{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T19:50:38Z","timestamp":1648842638979},"reference-count":11,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"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":[[1986,5]]},"DOI":"10.1016\/0020-0190(86)90068-2","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"291-294","source":"Crossref","is-referenced-by-count":6,"title":["Equivalent approximation algorithms for node cover"],"prefix":"10.1016","volume":"22","author":[{"given":"Dan","family":"Gusfield","sequence":"first","affiliation":[]},{"given":"Leonard","family":"Pitt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90068-2_BIB1","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/0196-6774(81)90020-1","article-title":"A linear time approximation algorithm for the weighted vertex cover problem","volume":"2","author":"Bar-Yehuda","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(86)90068-2_BIB2","series-title":"Mathematical Studies 109","article-title":"A local-ration theorem for approximating the weighted cover problem","volume":"25","author":"Bar-Yehuda","year":"1985"},{"issue":"3","key":"10.1016\/0020-0190(86)90068-2_BIB3","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":"Chvatal","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0020-0190(86)90068-2_BIB4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(83)90007-8","article-title":"A modification of the greedy algorithm for vertex cover","volume":"16","author":"Clarkson","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(86)90068-2_BIB5","series-title":"A Guide to the Theory of NP-Completeness","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(86)90068-2_BIB6","series-title":"Tech. Rept. #TR-308","article-title":"Understanding approximations for node cover and other subset selection problems","author":"Gusfield","year":"1984"},{"issue":"3","key":"10.1016\/0020-0190(86)90068-2_BIB7","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1137\/0211045","article-title":"Approximation algorithms for the set covering and vertex cover problems","volume":"11","author":"Hochbaum","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(86)90068-2_BIB8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(83)90080-X","article-title":"Efficient bounds for the stable set, vertex cover and set packing problems","volume":"6","author":"Hochbaum","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(86)90068-2_BIB9","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(86)90068-2_BIB10","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","article-title":"Vertex packing structural properties and algorithms","volume":"8","author":"Nemhauser","year":"1975","journal-title":"Math. Programm."},{"issue":"5","key":"10.1016\/0020-0190(86)90068-2_BIB11","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0020-0190(82)90022-9","article-title":"Depth-first search and the vertex cover problem","volume":"14","author":"Savage","year":"1982","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900682?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900682?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:30:03Z","timestamp":1553592603000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,5]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1986,5]]}},"alternative-id":["0020019086900682"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90068-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,5]]}}}