An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs

2004 ◽  
pp. 143-150 ◽  
Author(s):  
Yong Zhang ◽  
Hong Zhu
Keyword(s):  
Approximation Algorithm ◽  
Vertex Cover ◽  
Undirected Graphs ◽  
Vertex Cover Problem ◽  
Cover Problem

An approximation algorithm for the partial vertex cover problem in hypergraphs

2014 ◽  
Vol 31 (2) ◽  
pp. 846-864 ◽  
Author(s):  
Mourad El Ouali ◽  
Helena Fohlin ◽  
Anand Srivastav
Keyword(s):  
Approximation Algorithm ◽  
Vertex Cover ◽  
Vertex Cover Problem ◽  
Cover Problem

scholarly journals A Local 2-Approximation Algorithm for the Vertex Cover Problem

2009 ◽  
pp. 191-205 ◽  
Author(s):  
Matti Åstrand ◽  
Patrik Floréen ◽  
Valentin Polishchuk ◽  
Joel Rybicki ◽  
Jukka Suomela ◽  
...  
Keyword(s):  
Approximation Algorithm ◽  
Vertex Cover ◽  
Vertex Cover Problem ◽  
Cover Problem

Improved Approximation Algorithm for the Combination of Parallel Machine Scheduling and Vertex Cover

2017 ◽  
Vol 28 (08) ◽  
pp. 977-992 ◽  
Author(s):  
Wenyi Hong ◽  
Zhenbo Wang
Keyword(s):  
Approximation Algorithm ◽  
Parallel Machines ◽  
Vertex Cover ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Combination Problem ◽  
Vertex Cover Problem ◽  
Cover Problem

This paper studies the combination problem of parallel machine scheduling and the vertex cover problem. Wang and Cui developed a [Formula: see text]-approximation algorithm for this problem [13], where [Formula: see text] is the number of parallel machines. We reduce the approximation factors from [Formula: see text] to [Formula: see text] for [Formula: see text], from [Formula: see text] to [Formula: see text] for [Formula: see text], and to [Formula: see text] for [Formula: see text].

Sign in / Sign up

Export Citation Format

Share Document