{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T01:26:37Z","timestamp":1769045197044,"version":"3.49.0"},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6010,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0166-218x(96)00047-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"13-22","source":"Crossref","is-referenced-by-count":7,"title":["Preserving approximation in the Min\u2014Weighted Set Cover Problem"],"prefix":"10.1016","volume":"73","author":[{"given":"Giorgio","family":"Gambosi","sequence":"first","affiliation":[]},{"given":"Marco","family":"Protasi","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Talamo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00047-9_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\/S0166-218X(96)00047-9_BIB2","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\/S0166-218X(96)00047-9_BIB3","series-title":"Proceedings of the 28th ACM Symposium on Theory of Computing","article-title":"A threshold of ln (n) for approximating set cover","author":"Feige","year":"1996"},{"key":"10.1016\/S0166-218X(96)00047-9_BIB4","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."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000479?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000479?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:28:18Z","timestamp":1556116098000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000479"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0166218X96000479"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00047-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}