| Issue |
RAIRO-Oper. Res.
Volume 52, Number 1, January–March 2018
ROADEF 2017
|
|
|---|---|---|
| Page(s) | 305 - 314 | |
| DOI | https://doi.org/10.1051/ro/2017085 | |
| Published online | 30 May 2018 | |
Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio 0.7
Université Paris-Dauphine, PSL* Research University,
CNRS UMR 7243,
LAMSADE,
75016
Paris, France
* Corresponding author: paschos@lamsade.dauphine.fr
Received:
25
April
2017
Accepted:
30
October
2017
We propose and analyze a simple purely combinatorial algorithm for max k-vertex cover in bipartite graphs, achieving approximation ratio 0.7. The only combinatorial algorithm currently known until now for this problem is the natural greedy algorithm, that achieves ratio (e − 1)/e = 0.632.
Mathematics Subject Classification: 03D15 / 05C70 / 05C85 / 68Q25 / 68W25 / 68W40
Key words: Approximation algorithm / bipartite graph / max k-VERTEX cover
© EDP Sciences, ROADEF, SMAI 2018
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.