158 search results - page 1 / 32 » Evolutionary algorithms and the Vertex Cover problem |
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
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...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
— 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...
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
EPS
1998
Springer
13 years 11 months ago
1998
Springer
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 ...
WADS
2005
Springer
14 years 8 days ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...