{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T17:30:51Z","timestamp":1772127051773,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,12,13]],"date-time":"2014-12-13T00:00:00Z","timestamp":1418428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s00453-014-9962-9","type":"journal-article","created":{"date-parts":[[2014,12,12]],"date-time":"2014-12-12T15:28:24Z","timestamp":1418398104000},"page":"574-588","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Randomized Approximation for the Set Multicover Problem in Hypergraphs"],"prefix":"10.1007","volume":"74","author":[{"given":"Mourad","family":"El\u00a0Ouali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Munstermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Srivastav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,13]]},"reference":[{"key":"9962_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. Wiley, New York (2000)","edition":"2"},{"issue":"2","key":"9962_CR2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1006\/jagm.2000.1150","volume":"39","author":"R Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda, R.: Using homogeneous weights for approximating the partial cover problem. J. Algorithms 39(2), 137\u2013144 (2001)","journal-title":"J. Algorithms"},{"issue":"6\u20137","key":"9962_CR3","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1016\/j.dam.2004.11.009","volume":"155","author":"P Berman","year":"2007","unstructured":"Berman, P., DasGupta, B., Sontag, E.: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Discrete Appl. Math. 155(6\u20137), 733\u2013749 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"9962_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A greedy heuristic for the set covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"9962_CR5","doi-asserted-by":"crossref","unstructured":"El Ouali, M., Fohlin, H., Srivastav, A.: An Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs. J. Comb. Optim. (2014). doi: 10.1007\/s10878-014-9793-2","DOI":"10.1007\/s10878-014-9793-2"},{"key":"9962_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.tcs.2014.03.029","volume":"555","author":"M Ouali El","year":"2014","unstructured":"El Ouali, M., Fohlin, H., Srivastav, A.: A randomised approximation algorithm for the hitting set problem. Theor. Comput. Sci. 555, 23\u201334 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9962_CR7","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/jagm.2001.1183","volume":"41","author":"U Feige","year":"2001","unstructured":"Feige, U., Langberg, M.: Approximation algorithms for maximization problems arising in graph partitioning. J. Algorithms 41(2), 174\u2013201 (2001)","journal-title":"J. Algorithms"},{"key":"9962_CR8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"A Frieze","year":"1997","unstructured":"Frieze, A., Jerrum, M.: Improved Approximation Algorithms for MAX $$k$$ k -CUT and MAX BISECTION. Algorithmica 18, 67\u201381 (1997)","journal-title":"Algorithmica"},{"issue":"1","key":"9962_CR9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","volume":"53","author":"R Gandhi","year":"2004","unstructured":"Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms 53(1), 55\u201384 (2004)","journal-title":"J. Algorithms"},{"key":"9962_CR10","doi-asserted-by":"crossref","unstructured":"Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., Reed, B.: Probabilistic Methods for Algorithmic Discrete Mathematics, pp. 195\u2013248. Springer Berlin Heidelberg (1998)","DOI":"10.1007\/978-3-662-12788-9"},{"key":"9962_CR11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(86)90016-8","volume":"15","author":"NG Hall","year":"1986","unstructured":"Hall, N.G., Hochbaum, D.S.: A fast approximation algorithm for the multicovering problem. Discrete Appl. Math. 15, 35\u201340 (1986)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"9962_CR12","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1137\/S0097539700381097","volume":"31","author":"E Halperin","year":"2002","unstructured":"Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J. Comput. 31(5), 1608\u20131623 (2002)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9962_CR13","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"DS Hochbaum","year":"1982","unstructured":"Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11(3), 555\u2013556 (1982)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9962_CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10878-005-2269-7","volume":"10","author":"G J\u00e4ger","year":"2005","unstructured":"J\u00e4ger, G., Srivastav, A.: Improved approximation algorithms for maximum graph partitioning problems. J. Comb. Optim. 10(2), 133\u2013167 (2005)","journal-title":"J. Comb. Optim."},{"key":"9962_CR15","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9962_CR16","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1006\/jagm.1997.0872","volume":"25","author":"J Krivelevich","year":"1997","unstructured":"Krivelevich, J.: Approximate set covering in uniform hypergraphs. J. Algorithms 25(1), 118\u2013143 (1997)","journal-title":"J. Algorithms"},{"issue":"4","key":"9962_CR17","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Math. 13(4), 383\u2013390 (1975)","journal-title":"Discrete Math."},{"issue":"1","key":"9962_CR18","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BF02523687","volume":"18","author":"D Peleg","year":"1997","unstructured":"Peleg, D., Schechtman, G., Wool, A.: Randomized approximation of bounded multicovering problems. Algorithmica 18(1), 44\u201366 (1997)","journal-title":"Algorithmica"},{"issue":"3","key":"9962_CR19","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"9962_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2003","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2003)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9962-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9962-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9962-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:47:20Z","timestamp":1559087240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9962-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,13]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["9962"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9962-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,13]]}}}