Evolutionary Algorithms for Vertex Cover

@inproceedings{Evans1998EvolutionaryAF,
  title={Evolutionary Algorithms for Vertex Cover},
  author={Isaac K. Evans},
  booktitle={Evolutionary Programming},
  year={1998}
}
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… CONTINUE READING
Highly Cited
This paper has 36 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Reemphasizing Recombination in Evolutionary Search: Heuristics for Vertex Cover,

  • I. K. Evans
  • Ph.D. Thesis, University of Iowa,
  • 1997
Highly Influential
6 Excerpts

Enhanced Genetic Algorithms in Constrained Search Spaces with Emphasis in Parallel Environments,

  • V. Kommu
  • Ph.D. Thesis, The University of Iowa,
  • 1993
Highly Influential
5 Excerpts

Approximation Algorithms for NP-Hard Problems

  • D. S. Hochbaum, ed
  • PWS Publishing Company,
  • 1997
3 Excerpts

Similar Papers

Loading similar papers…