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

2016 ◽  
pp. 235-248 ◽  
Author(s):  
Édouard Bonnet ◽  
Bruno Escoffier ◽  
Vangelis Th. Paschos ◽  
Georgios Stamoulis
Keyword(s):  
Vertex Cover ◽  
Bipartite Graphs ◽  
Combinatorial Algorithm

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

2018 ◽  
Vol 52 (1) ◽  
pp. 305-314 ◽  
Author(s):  
Vangelis Th. Paschos
Keyword(s):  
Greedy Algorithm ◽  
Vertex Cover ◽  
Bipartite Graphs ◽  
Approximation Ratio ◽  
Combinatorial Algorithm

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.

Koszulness of Vertex Cover Algebras of Bipartite Graphs

2011 ◽  
Vol 39 (7) ◽  
pp. 2249-2259 ◽  
Author(s):  
Giancarlo Rinaldo
Keyword(s):  
Vertex Cover ◽  
Bipartite Graphs

Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs

2017 ◽  
Vol 31 (3) ◽  
pp. 2172-2184 ◽  
Author(s):  
Bugra Caskurlu ◽  
Vahan Mkrtchyan ◽  
Ojas Parekh ◽  
K. Subramani
Keyword(s):  
Vertex Cover ◽  
Bipartite Graphs ◽  
Maximum Coverage

scholarly journals Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs

2018 ◽  
Vol 27 ◽  
pp. 26-56
Author(s):  
Édouard Bonnet ◽  
Bruno Escoffier ◽  
Vangelis Th. Paschos ◽  
Georgios Stamoulis
Keyword(s):  
Approximation Algorithms ◽  
Vertex Cover ◽  
Bipartite Graphs
Sign in / Sign up

Export Citation Format

Share Document