26 search results - page 1 / 6 » Analysis of population-based evolutionary algorithms for the... |
CEC
2008
IEEE
14 years 3 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...
GECCO
2009
Springer
14 years 3 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
2007
IEEE
14 years 2 months ago
2007
IEEE
COR
2006
13 years 8 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...