{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:24:14Z","timestamp":1649075054340},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":[[1995,7]]},"DOI":"10.1016\/0020-0190(95)00058-k","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:04:31Z","timestamp":1027649071000},"page":"95-98","source":"Crossref","is-referenced-by-count":2,"title":["Iterative improvement of vertex covers"],"prefix":"10.1016","volume":"55","author":[{"given":"Youssef","family":"Saab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00058-K_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0020-0190(95)00058-K_BIB2","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(95)00058-K_BIB3","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(95)00058-K_BIB4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"A n52 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"Siam J. Comput."},{"key":"10.1016\/0020-0190(95)00058-K_BIB5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00290149","article-title":"Ramsey numbers and an approximation algorithm for the vertex cover problem","volume":"22","author":"Monien","year":"1985","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(95)00058-K_BIB6","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. Programming"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500058K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500058K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T02:59:18Z","timestamp":1555297158000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500058K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["002001909500058K"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00058-k","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}