Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio 0.7

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.

Saved in:
Bibliographic Details
Published inR.A.I.R.O. Recherche opérationnelle Vol. 52; no. 1; pp. 305 - 314
Main Author Paschos, Vangelis Th
Format Journal Article
LanguageEnglish
Published Paris EDP Sciences 01.01.2018
Subjects
03D15
05C70
05C85
68Q25
68W25
68W40
Algorithms
Approximation
Approximation algorithm
bipartite graph
Combinatorial analysis
Computer Science
Graphs
Greedy algorithms
Mathematical analysis
max k-VERTEX cover
Online AccessGet full text
ISSN0399-0559
1290-3868
DOI10.1051/ro/2017085

Cover

More Information
Summary: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.
Bibliography:istex:5A62E4206113E184A04EBBF31F09E88EEC4F3F8D
ark:/67375/80W-2Z4GQ8GB-G
publisher-ID:ro170157
href:https://www.rairo-ro.org/articles/ro/abs/2018/01/ro170157/ro170157.html
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0399-0559
1290-3868
DOI:10.1051/ro/2017085