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

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.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01343951
Contributor : Bruno Escoffier <>
Submitted on : Monday, July 11, 2016 - 10:10:55 AM
Last modification on : Thursday, March 21, 2019 - 2:44:24 PM

Identifiers

Citation

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⟩

Share

Metrics

Record views

92