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]
@inproceedings{OualiFS12,
title = {A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs},
author = {Mourad El Ouali and Helena Fohlin and Anand Srivastav},
year = {2012},
doi = {10.1007/978-3-642-34862-4_13},
url = {http://dx.doi.org/10.1007/978-3-642-34862-4_13},
researchr = {https://researchr.org/publication/OualiFS12},
cites = {0},
citedby = {0},
pages = {174-187},
booktitle = {Design and Analysis of Algorithms - First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proceedings},
editor = {Guy Even and Dror Rawitz},
volume = {7659},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-34861-7},
}