Browse > Article
http://dx.doi.org/10.3745/KIPSTB.2008.15-B.6.609

Applying Genetic Algorithm to the Minimum Vertex Cover Problem  

Han, Keun-Hee (공주대학교 응용수학과)
Kim, Chan-Soo (공주대학교 응용수학과)
Publication Information
The KIPS Transactions:PartB / v.15B, no.6, 2008 , pp. 609-612 More about this Journal
Abstract
Let G = (V, E) be a simple undirected graph. The Minimum Vertex Cover (MVC) problem is to find a minimum subset C of V such that for every edge, at least one of its endpoints should be included in C. Like many other graph theoretic problems this problem is also known to be NP-hard. In this paper, we propose a genetic algorithm called LeafGA for MVC problem and show the performance of the proposed algorithm by applying it to several published benchmark graphs.
Keywords
Genetic Algorithm; Graph; Minimum Vertex Cover Problem;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. Motwani, “Lecture notes on approximation algorithms: Volume I,” Tech. Rep. CS-TR-92-1435, Stanford University, Department of Computer Science, Stanford University, CA, 1992
2 Holland, J., “Adaptation in natural and artificial systems,” University of Michigan Press, Ann Arbor, 1975
3 S. Khuri and T. Back, “An evolutionary heuristic for the minimum vertex cover problem,” Proc. of the KI-94 Workshop, pp.86-90, 1994
4 I. K. Evans, “Evolutionary algorithms for vertex cover,” Lecture Notes in Computer Science, Vol. 1477, pp.377-386, 1998   DOI   ScienceOn
5 Gilmour, S. and Dras, M., “Kernelization as heuristic structure for the vertex cover problem,” proceedings of the Third Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS 2006), Brussels, Belgium, 2006
6 Jun He, Xin Yao and Jin Li, “A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problem,” IEEE Transactions on Systems, Man and Cybernetics, Part C 35(2), pp.266-271, 2005   DOI   ScienceOn
7 Xu, K., “BHOSLIB: Benchmarks with hidden optimum solutions for graph problems (maximum clique, maximum independent set, minimum vertex cover and vertex coloring) – hiding exact solutions in random graphs,” Web site, http://www.nlsde.buaa.edu.en/～kexu/benchmarks/graphbenchmarks.htm