{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T08:11:24Z","timestamp":1774080684518,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"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":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115849","type":"journal-article","created":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T08:08:58Z","timestamp":1772093338000},"page":"115849","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A hybrid algorithm based on a multiple randomized rounding for set multicover problem: Approximation guarantees and experiments"],"prefix":"10.1016","volume":"1071","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0176-7898","authenticated-orcid":false,"given":"Abbass","family":"Gorgi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4864-3171","authenticated-orcid":false,"given":"Adnane","family":"Fouadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9748-0271","authenticated-orcid":false,"given":"Bousselham","family":"Ganbouri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8621-7902","authenticated-orcid":false,"given":"Mourad","family":"El Ouali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115849_bib0001","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"2","key":"10.1016\/j.tcs.2026.115849_bib0002","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1006\/jagm.2000.1150","article-title":"Using homogeneous weights for approximating the partial cover problem","volume":"39","author":"Bar-Yehuda","year":"2001","journal-title":"J. Algo."},{"issue":"1","key":"10.1016\/j.tcs.2026.115849_bib0003","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","article-title":"Approximation algorithms for partial covering problems","volume":"53","author":"Gandhi","year":"2004","journal-title":"J. Algo."},{"key":"10.1016\/j.tcs.2026.115849_bib0004","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.tcs.2020.09.009","article-title":"Approximation of set multi-cover via hypergraph matching","volume":"845","author":"Gorgi","year":"2020","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.tcs.2026.115849_bib0005","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."},{"issue":"1","key":"10.1016\/j.tcs.2026.115849_bib0006","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s00453-012-9629-3","article-title":"Greedy \u0394-approximation algorithm for covering with arbitrary constraints and submodular cost","volume":"66","author":"Koufogiannakis","year":"2013","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115849_bib0007","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. Syst. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2026.115849_bib0008","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","article-title":"On the ratio of optimal integral and fractional covers","volume":"13","author":"Lov\u00e1sz","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2026.115849_bib0009","series-title":"Proc. 29th Annual Symposium on Theory on Computing","first-page":"256","article-title":"Approximating k-set cover by semi-local optimization","author":"Duh","year":"1997"},{"issue":"2","key":"10.1016\/j.tcs.2026.115849_bib0010","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."},{"key":"10.1016\/j.tcs.2026.115849_bib0011","series-title":"Proc. 3rd International Workshop on Approximation and Online Algorithms","first-page":"176","article-title":"A better-than-greedy algorithm for k-set multicover","author":"Fujito","year":"2006"},{"key":"10.1016\/j.tcs.2026.115849_bib0012","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(86)90016-8","article-title":"A fast approximation algorithm for the multicovering problem","volume":"15","author":"Hall","year":"1986","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.tcs.2026.115849_bib0013","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"},{"key":"10.1016\/j.tcs.2026.115849_bib0014","series-title":"Proc. 2nd Israel Symp. on Theory of Computing Systems","first-page":"69","article-title":"Approximating bounded 0\u20131 integer linear programs","author":"Peleg","year":"1993"},{"issue":"2","key":"10.1016\/j.tcs.2026.115849_bib0015","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":"Ouali","year":"2016","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115849_bib0016","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s10878-020-00688-9","article-title":"Approximation algorithm for the multicovering problem","volume":"41","author":"Gorgi","year":"2021","journal-title":"J. Comb. Optim."},{"issue":"5","key":"10.1016\/j.tcs.2026.115849_bib0017","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":"4","key":"10.1016\/j.tcs.2026.115849_bib0018","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","article-title":"A threshold of ln\u2009n for approximating set cover","volume":"45","author":"Feige","year":"1998","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.tcs.2026.115849_bib0019","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":"Ouali","year":"2016","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2026.115849_bib0020","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.tcs.2014.03.029","article-title":"A randomized approximation algorithm for the hitting set problem","volume":"555","author":"Ouali","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115849_bib0021","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1012778715468","article-title":"Combinatorial problems of packing and covering and related problems of integer linear programming","volume":"108","author":"Kuzjurin","year":"2002","journal-title":"J. Math. Sci."},{"key":"10.1016\/j.tcs.2026.115849_bib0022","article-title":"Theory of Evolutionary Computation: Recent Developments in Discrete Optimization","year":"2019"},{"key":"10.1016\/j.tcs.2026.115849_bib0023","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"issue":"11","key":"10.1016\/j.tcs.2026.115849_bib0024","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-library: distributing test problems by electronic mail","volume":"41","author":"Beasley","year":"1990","journal-title":"J. Oper. Res. Soc"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001088?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001088?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T07:36:37Z","timestamp":1774078597000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":24,"alternative-id":["S0304397526001088"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115849","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A hybrid algorithm based on a multiple randomized rounding for set multicover problem: Approximation guarantees and experiments","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115849","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115849"}}