Quarterly (spring, summer, fall, winter)
176 pp. per issue
7 x 10
ISSN
1063-6560
E-ISSN
1530-9304
2014 Impact factor:
2.37

Evolutionary Computation

Spring 2009, Vol. 17, No. 1, Pages 3-19.
(doi: 10.1162/evco.2009.17.1.3)
© 2009 by the Massachusetts Institute of Technology
Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem*
Article PDF (254.69 KB)
Abstract

Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast, the theoretical understanding of the interplay of different optimization methods is rare. In this paper, we make a first step into the rigorous analysis of such combinations for combinatorial optimization problems. The subject of our analyses is the vertex cover problem for which several approximation algorithms have been proposed. We point out specific instances where solutions can (or cannot) be improved by the search process of a simple evolutionary algorithm in expected polynomial time.