A 0.821-ratio purely combinatorial algorithm for maximum $k$-vertex cover in bipartite graphs
Data Structures and Algorithms
2015-04-07 v2
Abstract
Our goal in this paper is to propose a \textit{combinatorial algorithm} that beats the only such algorithm known previously, the greedy one. We study the polynomial approximation of the Maximum Vertex Cover Problem in bipartite graphs by a purely combinatorial algorithm and present a computer assisted analysis of it, that finds the worst case approximation guarantee that is bounded below by~0.821.
Cite
@article{arxiv.1409.6952,
title = {A 0.821-ratio purely combinatorial algorithm for maximum $k$-vertex cover in bipartite graphs},
author = {Edouard Bonnet and Bruno Escoffier and Vangelis Paschos and Georgios Stamoulis},
journal= {arXiv preprint arXiv:1409.6952},
year = {2015}
}
Comments
25 pages, 2 figures