Evolutionary algorithms and the Vertex Cover problem

@article{Oliveto2007EvolutionaryAA,
  title={Evolutionary algorithms and the Vertex Cover problem},
  author={Pietro Simone Oliveto and Jun He and Xin Yao},
  journal={2007 IEEE Congress on Evolutionary Computation},
  year={2007},
  pages={1870-1877}
}
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… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS
25 Citations
18 References
Similar Papers

References

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

Evolutionary algorithms and the vertex cover problem

  • P.S.Oliveto, J. He, X. Yao
  • School of computer science, University of…
  • 2007
1 Excerpt

A study of drift analysis for estimating computation time of evolutionary algorithms

  • ——
  • Natural Computing: an international journal, vol…
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…