{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:45:26Z","timestamp":1725500726555},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_11","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T16:36:53Z","timestamp":1358786213000},"page":"101-113","source":"Crossref","is-referenced-by-count":0,"title":["A Randomised Approximation Algorithm for the Hitting Set Problem"],"prefix":"10.1007","author":[{"given":"Mourad","family":"El Ouali","sequence":"first","affiliation":[]},{"given":"Helena","family":"Fohlin","sequence":"additional","affiliation":[]},{"given":"Anand","family":"Srivastav","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/1150334.1150336","volume":"2","author":"N. Alon","year":"2006","unstructured":"Alon, N., Moshkovitz, D., Safra, S.: Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms (ACM)\u00a02, 153\u2013177 (2006)","journal-title":"ACM Trans. Algorithms (ACM)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Spencer, J.: The probabilistic method, 2nd edn. Wiley Interscience (2000)","DOI":"10.1002\/0471722154"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/0196-6774(81)90020-1","volume":"2","author":"R. Bar-Yehuda","year":"1981","unstructured":"Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms\u00a02, 198\u2013203 (1981)","journal-title":"Journal of Algorithms"},{"key":"11_CR4","series-title":"Annals of Discrete Math.","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0304-0208(08)73101-3","volume-title":"Analysis and Design of Algorithms for Combinatorial Problems","author":"R. Bar-Yehuda","year":"1985","unstructured":"Bar-Yehuda, R., Even, S.: A local ratio theorem for approximating weighted vertex cover problem. In: Ausiello, G., Lucertini, M. (eds.) Analysis and Design of Algorithms for Combinatorial Problems. Annals of Discrete Math., vol.\u00a025, pp. 27\u201346. Elsevier, Amsterdam (1985)"},{"key":"11_CR5","unstructured":"Berge, C.: Hypergraphs-combinatorics of finite sets. North Holland Mathematical Library (1989)"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set covering problem. Math. Oper. Res.\u00a04(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A treshold of ln n for approximating set cover. Journal of the ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","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. Journal of Algorithms\u00a041(2), 174\u2013201 (2001)","journal-title":"Journal of Algorithms"},{"key":"11_CR9","doi-asserted-by":"publisher","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-cut and max bisection. Algorithmica\u00a018, 67\u201381 (1997)","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF01864160","volume":"4","author":"Z. F\u00fcredi","year":"1988","unstructured":"F\u00fcredi, Z.: Matchings and covers in hypergraphs. Graphs and Combinatorics\u00a04(1), 115\u2013206 (1988)","journal-title":"Graphs and Combinatorics"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","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\u00a053(1), 55\u201384 (2004)","journal-title":"J. Algorithms"},{"key":"11_CR12","unstructured":"Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. In: ACM-SIAM Symposium on Discrete Algorithms, vol.\u00a011, pp. 329\u2013337 (2000)"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"D.S. Hochbaum","year":"1982","unstructured":"Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM J. Computation\u00a011(3), 555\u2013556 (1982)","journal-title":"SIAM J. Computation"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(86)90016-8","volume":"15","author":"N.G. Hall","year":"1986","unstructured":"Hall, N.G., Hochbaum, D.S.: A fast approximation for the multicovering problem. Discrete Appl. Math.\u00a015, 35\u201340 (1986)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","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. Journal of Combinatorial Optimization\u00a010(2), 133\u2013167 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci.\u00a09, 256\u2013278 (1974)","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"11_CR17","doi-asserted-by":"publisher","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.\u00a074(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","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\u00a025(1), 118\u2013143 (1997)","journal-title":"J. Algorithms"},{"key":"11_CR19","doi-asserted-by":"publisher","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.\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Math."},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. Assoc. Comput. Mach.\u00a041, 960\u2013981 (1994)","journal-title":"J. Assoc. Comput. Mach."},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-662-12788-9_6","volume-title":"Probabilistic Methods for Algorithmic Discrete Mathematics","author":"C. McDiarmid","year":"1998","unstructured":"McDiarmid, C.: Concentration. In: Habib, M., McDiarmid, C., Ramirez-Alfonsin, J., Reed, B. (eds.) Probabilistic Methods for Algorithmic Discrete Mathematics, pp. 195\u2013248. Springer, Berlin (1998)"},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","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\u00a018(1), 44\u201366 (1997)","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR23","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.disopt.2004.11.002","volume":"2","author":"M. Okun","year":"2005","unstructured":"Okun, M.: On approximation of the vertex cover problem in hypergraphs. Discrete Optimization (DISOPT)\u00a02(1), 101\u2013111 (2005)","journal-title":"Discrete Optimization (DISOPT)"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proc. 29th ACM Symp. on Theory of Computing, pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T18:44:19Z","timestamp":1557513859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}