The KIPS Transactions:PartA (정보처리학회논문지A)

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

DOI QR Code

Improving Efficiency of Minimum Dominating Set Problem using Simulated Annealing Algorithms

Simulated Annealing 알고리즘을 이용한 최소 Dominating Set 문제의 효율성 증가에 대한 연구

  • 정태의 (서경대학교 컴퓨터과학과)
  • Received : 2010.03.23
  • Accepted : 2011.02.08
  • Published : 2011.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

The minimum dominating set problem of a graph G is to find a smallest possible dominating set. The minimum dominating set problem is a well-known NP-complete problem such that it cannot be solved in polynomial time. Heuristic or approximation algorithm, however, will perform well in certain area of application. In this paper, we suggest three different simulated annealing algorithms and experimentally show better efficiency improvement by applying these algorithms to the graph instances developed by DIMACS.

그래프 G의 최소 dominating set 문제는 G의 dominating set들 중 가장 작은 크기의 dominating set을 찾는 문제이며, NP-complete class에 속해 polynomial time안에 해결할 수 없는 문제로 잘 알려져 있다. 그러나, heuristic한 방법 혹은 approximation 방법을 이용해 특정한 분야에 적용이 가능하다. 본 논문에서는 세 개의 서로 다른 simulated annealing 알고리즘을 제시하여, 이들 알고리즘을 DIMACS에서 제시한 그래프들에 적용한 경우 효율성 증가가 이루어지는 것을 실험적으로 보이고자 한다.

Keywords

References

  1. West. B, "Introduction to Graph Theory", Hall & Co.. 2000.
  2. Teresa W. Haynes, Stephen T. Hedetniemi, Peter J. Slater, "Fundamentals of Domination in Graph", Maecel Dekker. 1998.
  3. Abhay, K. Parekh, "Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs", Information Processing Letters, Vol.39, pp.237-240, 1991. https://doi.org/10.1016/0020-0190(91)90021-9
  4. L. A, "Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem", Algorithmica, Vol.33, pp.3-18, 2002. https://doi.org/10.1007/s00453-001-0101-z
  5. F. Kuhn. and R. Wattenhofer, "Constant-time distributed dominating set approximation", Distrib. Comput., Vol.17, pp.303-310, 2005. https://doi.org/10.1007/s00446-004-0112-5
  6. V. Turau, "Linear Self-Stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler" Information Processing Letters, Vol.103, pp.88-93, 2007. https://doi.org/10.1016/j.ipl.2007.02.013
  7. Garey, M. R. and Johnson, D. S. Computers and Intractability "A Guide to the Theory of NP-Completeness", W. H. Freeman & Co., 1979.
  8. S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi, "Optimization by Simulated Annealing," Science, Vol.220, No.4598, pp.671-680, 1983. https://doi.org/10.1126/science.220.4598.671
  9. P. J. M. Van-Laarhoven, E. Aarts, Simulated Annealing: Theory and Applications, Kluwer, Dordrecht, 1987.
  10. Johnson, D.S., Trick, M.A., eds.: Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge. Vol.26 of DIMACS Series. American Mathematical Society, 1996.