Evolutionary Algorithms for Vertex Cover

13 years 1 months ago
Evolutionary Algorithms for Vertex Cover
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 encoding scheme for VC and related problems that treats each chromosome as a binary decision diagram. As a result, the encoding allows only a (guaranteed optimal) subset of feasible solutions. The encoding also incorporates features of a powerful traditional heuristic for VC that allow initial EA populations to be seeded in known promising regions of the search space. The resulting evolutionary algorithms have displayed exceptionally strong empirical performance on various vertex cover, independent set, and maximum clique problem classes.
Isaac K. Evans
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where EPS
Authors Isaac K. Evans
Comments (0)