Abstract
We study the polynomial time approximation of the max k-vertex cover problem in bipartite graphs and propose a purely combinatorial algorithm that beats the only such known algorithm, namely the greedy approach. We present a computer-assisted analysis of our algorithm, establishing that the worst case approximation guarantee is bounded below by 0.821.
Cite
CITATION STYLE
Bonnet, É., Escoffier, B., Paschos, V. T., & Stamoulis, G. (2016). A 0.821-ratio purely combinatorial algorithm for maximum k-vertex cover in bipartite graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9644, pp. 235–248). Springer Verlag. https://doi.org/10.1007/978-3-662-49529-2_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
