A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs

Edouard Bonnet (1) , Bruno Escoffier (2) , Vangelis Paschos (1) , Giorgios Stamoulis

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision
2 RO - Recherche Opérationnelle

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.

Domaines: Informatique [cs]

Edouard Bonnet, Bruno Escoffier, Vangelis Paschos, Giorgios Stamoulis. A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, 2016, Ensenada, Mexico. pp.235-248, ⟨10.1007/978-3-662-49529-2⟩. ⟨hal-01343951⟩