Analyses of simple hybrid algorithms for the vertex cover problem.
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.
Friedrich
Tobias
T
Max-Planck-Institut für Informatik, Saarbrücken, Germany. tobias.friedrich@mpi-inf.mpg.de
He
Jun
J
Hebbinghaus
Nils
N
Neumann
Frank
F
Witt
Carsten
C
D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D008962:Models, Theoretical; D010363:Pattern Recognition, Automated / Q000379:methods; D011336:Probability; D011340:Problem Solving; D013997:Time Factors