A Hybrid Evolutionary Algorithm with Taboo and Competition Strategies for Minimum Vertex Cover Problem

2019 ◽  
pp. 725-732
Author(s):  
Gang Yang ◽  
Daopeng Wang ◽  
Jieping Xu
Keyword(s):  
Evolutionary Algorithm ◽  
Vertex Cover ◽  
Hybrid Evolutionary Algorithm ◽  
Vertex Cover Problem ◽  
Cover Problem ◽  
Minimum Vertex Cover Problem

scholarly journals MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 60774-60784 ◽  
Author(s):  
Ping Guo ◽  
Changsheng Quan ◽  
Haizhu Chen
Keyword(s):  
Evolutionary Algorithm ◽  
Vertex Cover ◽  
Vertex Cover Problem ◽  
Cover Problem ◽  
Minimum 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].

A new motion equation for the minimum vertex cover problem

2004 ◽  
Vol 56 ◽  
pp. 441-446 ◽  
Author(s):  
XinShun Xu ◽  
Zheng Tang ◽  
RongLong Wang ◽  
XuGang Wang
Keyword(s):  
Vertex Cover ◽  
Motion Equation ◽  
Vertex Cover Problem ◽  
Cover Problem ◽  
Minimum Vertex Cover Problem
Sign in / Sign up

Export Citation Format

Share Document