{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T05:12:17Z","timestamp":1734066737834,"version":"3.30.2"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"vor","delay-in-days":1472,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1016\/j.tcs.2020.09.009","type":"journal-article","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T15:32:00Z","timestamp":1599751920000},"page":"136-143","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Approximation of set multi-cover via hypergraph matching"],"prefix":"10.1016","volume":"845","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0176-7898","authenticated-orcid":false,"given":"Abbass","family":"Gorgi","sequence":"first","affiliation":[]},{"given":"Mourad","family":"El Ouali","sequence":"additional","affiliation":[]},{"given":"Anand","family":"Srivastav","sequence":"additional","affiliation":[]},{"given":"Mohamed","family":"Hachimi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1973","author":"Berge","series-title":"Graphs and Hypergraphs","key":"10.1016\/j.tcs.2020.09.009_br0010"},{"year":"2019","author":"Chekuri","article-title":"Approximating (sparse) covering integer programs","series-title":"Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019","key":"10.1016\/j.tcs.2020.09.009_br0020"},{"year":"2019","author":"Chekuri","article-title":"\u21131-sparsity approximation bounds for packing integer programs","series-title":"Proceedings of 20th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2019","key":"10.1016\/j.tcs.2020.09.009_br0030"},{"issue":"5","key":"10.1016\/j.tcs.2020.09.009_br0040","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1137\/S0097539704443057","article-title":"A new multilayered PCP and the hardness of hypergraph vertex cover","volume":"34","author":"Dinur","year":"2005","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.tcs.2020.09.009_br0050","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1007\/s10878-014-9793-2","article-title":"An approximation algorithm for the partial vertex cover problem in hypergraphs","volume":"31","author":"El Ouali","year":"2016","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2020.09.009_br0060","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.tcs.2014.03.029","article-title":"A randomised approximation algorithm for the hitting set problem","volume":"555","author":"El Ouali","year":"2014","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2020.09.009_br0070","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1007\/s00453-014-9962-9","article-title":"Randomized approximation for set multicover in hypergraphs","volume":"74","author":"El Ouali","year":"2016","journal-title":"Algorithmica"},{"issue":"5","key":"10.1016\/j.tcs.2020.09.009_br0080","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1137\/S0097539700381097","article-title":"Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs","volume":"31","author":"Halperin","year":"2002","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2020.09.009_br0090","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\/j.tcs.2020.09.009_br0100","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"3","key":"10.1016\/j.tcs.2020.09.009_br0110","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","article-title":"Vertex cover might be hard to approximate to within 2-epsilon","volume":"74","author":"Khot","year":"2008","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2020.09.009_br0120","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1006\/jagm.1997.0872","article-title":"Approximate set covering in uniform hypergraphs","volume":"25","author":"Krivelevich","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/j.tcs.2020.09.009_br0130","series-title":"MFCS","first-page":"615","article-title":"Greedy approximation via duality for packing, combinatorial auctions and routing","volume":"vol. 3618","author":"Krysta","year":"2005"},{"issue":"2","key":"10.1016\/j.tcs.2020.09.009_br0140","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/S0097539793260763","article-title":"Primal-dual RNC approximation algorithms for set cover and covering integer programs","volume":"28","author":"Rajagopalan","year":"1998","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2020.09.009_br0150","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BF02523687","article-title":"Randomized approximation of bounded multicovering problems","volume":"18","author":"Peleg","year":"1997","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/j.tcs.2020.09.009_br0160","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1137\/S0097539796314240","article-title":"Improved approximation guarantees for packing and covering integer programs","volume":"29","author":"Srinivasan","year":"1999","journal-title":"SIAM J. Comput."},{"year":"1992","author":"Wool","series-title":"Approximating bounded 0-1 integer linear programs","key":"10.1016\/j.tcs.2020.09.009_br0170"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397520305077?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397520305077?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T05:19:55Z","timestamp":1733980795000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397520305077"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":17,"alternative-id":["S0304397520305077"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2020.09.009","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2020,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximation of set multi-cover via hypergraph matching","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2020.09.009","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}