A linear-time approximation algorithm for the weighted vertex cover problem

1981 ◽  
Vol 2 (2) ◽  
pp. 198-203 ◽  
Author(s):  
R Bar-Yehuda ◽  
S Even
Keyword(s):  
Approximation Algorithm ◽  
Linear Time ◽  
Vertex Cover ◽  
Time Approximation ◽  
Vertex Cover Problem ◽  
Weighted Vertex ◽  
Cover Problem

scholarly journals Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem

2019 ◽  
Vol 27 (4) ◽  
pp. 559-575
Author(s):  
Mojgan Pourhassan ◽  
Feng Shi ◽  
Frank Neumann
Keyword(s):  
Evolutionary Algorithm ◽  
Complexity Analysis ◽  
Minimum Weight ◽  
Vertex Cover ◽  
Optimal Solution ◽  
Population Based ◽  
Mutation Operator ◽  
Vertex Cover Problem ◽  
Weighted Vertex ◽  
Cover Problem

Evolutionary multiobjective optimization for the classical vertex cover problem has been analysed in Kratsch and Neumann ( 2013 ) in the context of parameterized complexity analysis. This article extends the analysis to the weighted vertex cover problem in which integer weights are assigned to the vertices and the goal is to find a vertex cover of minimum weight. Using an alternative mutation operator introduced in Kratsch and Neumann ( 2013 ), we provide a fixed parameter evolutionary algorithm with respect to [Formula: see text], the cost of an optimal solution for the problem. Moreover, we present a multiobjective evolutionary algorithm with standard mutation operator that keeps the population size in a polynomial order by means of a proper diversity mechanism, and therefore, manages to find a 2-approximation in expected polynomial time. We also introduce a population-based evolutionary algorithm which finds a [Formula: see text]-approximation in expected time [Formula: see text].

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 Crown reductions for the Minimum Weighted Vertex Cover problem

2008 ◽  
Vol 156 (3) ◽  
pp. 292-312 ◽  
Author(s):  
Miroslav Chlebík ◽  
Janka Chlebíková
Keyword(s):  
Vertex Cover ◽  
Vertex Cover Problem ◽  
Weighted Vertex ◽  
Cover Problem

NuMWVC: A novel local search for minimum weighted vertex cover problem

2019 ◽  
Vol 71 (9) ◽  
pp. 1498-1509 ◽  
Author(s):  
Ruizhi Li ◽  
Shuli Hu ◽  
Shaowei Cai ◽  
Jian Gao ◽  
Yiyuan Wang ◽  
...  
Keyword(s):  
Local Search ◽  
Vertex Cover ◽  
Vertex Cover Problem ◽  
Weighted Vertex ◽  
Cover Problem
Sign in / Sign up

Export Citation Format

Share Document