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

Thumbnail
View/Open
Date
2016
Dewey
Programmation, logiciels, organisation des données
Sujet
Approximation Guarantee; Computer-assisted Analysis; Semiregular Bipartite Graph; Generalized Reduced Gradient (GRG); Approximation Ratio
DOI
http://dx.doi.org/10.1007/978-3-662-49529-2_18
Conference name
12th Latin American Theoretical Informatics Symposium (LATIN 2016)
Conference date
04-2016
Conference city
Ensenada
Conference country
Mexico
Book title
LATIN 2016: Theoretical Informatics
Author
Kranakis, Evangelos; Navarro, Gonzalo; Chávez, Edgar
Publisher
Springer
ISBN
978-3-662-49529-2
Book URL
10.1007/978-3-662-49529-2
URI
https://basepub.dauphine.fr/handle/123456789/20959
Collections
Metadata
Show full item record
Author
Bonnet, Edouard
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Escoffier, Bruno
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Paschos, Vangelis
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Stamoulis, Giorgios
Type
Communication / Conférence
Item number of pages
235-248
Abstract (EN)
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.