A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs

Mourad El Ouali, Helena Fohlin, Anand Srivastav. A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs. In Guy Even, Dror Rawitz, editors, Design and Analysis of Algorithms - First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proceedings. Volume 7659 of Lecture Notes in Computer Science, pages 174-187, Springer, 2012. [doi]

Authors

Mourad El Ouali

This author has not been identified. Look up 'Mourad El Ouali' in Google

Helena Fohlin

This author has not been identified. Look up 'Helena Fohlin' in Google

Anand Srivastav

This author has not been identified. Look up 'Anand Srivastav' in Google