Sciweavers

188 search results - page 1 / 38
» Evolutionary Algorithms for Vertex Cover
Sort
View
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
13 years 11 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann
EPS
1998
Springer
13 years 9 months ago
Evolutionary Algorithms for Vertex Cover
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...
Isaac K. Evans
CEC
2008
IEEE
13 years 11 months ago
Analysis of population-based evolutionary algorithms for the vertex cover problem
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
Pietro Simone Oliveto, Jun He, Xin Yao
CEC
2007
IEEE
13 years 11 months ago
Evolutionary algorithms and the Vertex Cover problem
Pietro Simone Oliveto, Jun He, Xin Yao
GECCO
2007
Springer
169views Optimization» more  GECCO 2007»
13 years 11 months ago
Hybrid evolutionary algorithms on minimum vertex cover for random graphs
Martin Pelikan, Rajiv Kalapala, Alexander K. Hartm...