The KIPS Transactions:PartB (정보처리학회논문지B)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Applying Genetic Algorithm to the Minimum Vertex Cover Problem

Minimum Vertex Cover 문제에 대한 유전알고리즘 적용

  • Published : 2008.12.31
Download PDF
⟨ Previous Next ⟩

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.

G = (V, E) 를 단순 무방향성 그래프라 하자. Minimum Vertex Cover (MVC) 문제는 C 를 V 의 부분 집합이라 할 때 모든 간선들이 C 내의 최소 한 개 정점과 인접하게 되는 최소 집합 C 를 계산하는 것이다. 다른 많은 그래프 이론 문제와 마찬가지로 본 문제도 NP-hard 문제임이 증명되었다. 본 논문에서는 MVC 문제를 위한 LeafGA 라는 새로운 유전 알고리즘을 제시하며 또한 제시된 알고리즘을 널리 알려 진 기준 그래프들에 적용함으로써 그 효용성을 보인다.

Keywords

References

  1. Holland, J., “Adaptation in natural and artificial systems,” University of Michigan Press, Ann Arbor, 1975
  2. S. Khuri and T. Back, “An evolutionary heuristic for the minimum vertex cover problem,” Proc. of the KI-94 Workshop, pp.86-90, 1994
  3. I. K. Evans, “Evolutionary algorithms for vertex cover,” Lecture Notes in Computer Science, Vol. 1477, pp.377-386, 1998 https://doi.org/10.1007/BFb0040790
  4. 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 https://doi.org/10.1109/TSMCC.2004.841903
  5. 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
  6. 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
  7. 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