Evolutionary algorithms and the vertex cover problem

P.S. OLIVETO, J. HE, X. YAO

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

19 Citations (Scopus)

Abstract

Experimental results have suggested that evolutionary algorithms may produce higher quality solutions for instances of Vertex Cover than a very well known approximation algorithm for this NP-Complete problem. A theoretical analysis of the expected runtime of the (1+1)-EA on a well studied instance class confirms such a conjecture for the considered class. Furthermore, a class for which the (1+1)-EA takes exponential optimization time is examined. Nevertheless, given polynomial time, the evolutionary algorithm still produces a better solution than the approximation algorithm. Recently, the existence of an instance class has been proved for which the (1+1)-EA produces poor approximate solutions, given polynomial time. Here it is pointed out that, by using multiple runs, the (1+1)-EA finds the optimal cover of each instance of the considered graph class in polynomial time. ©2007 IEEE.
Original languageEnglish
Title of host publication2007 IEEE Congress on Evolutionary Computation, CEC 2007
Pages1870-1877
Number of pages8
DOIs
Publication statusPublished - Sept 2007
Externally publishedYes

Fingerprint

Dive into the research topics of 'Evolutionary algorithms and the vertex cover problem'. Together they form a unique fingerprint.

Cite this