Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2011.18A.2.069

Improving Efficiency of Minimum Dominating Set Problem using Simulated Annealing Algorithms  

Jeong, Tae-Eui (서경대학교 컴퓨터과학과)
Publication Information
The KIPS Transactions:PartA / v.18A, no.2, 2011 , pp. 69-74 More about this Journal
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.
Keywords
Minimum Dominating Set Problem; Simulated Annealing Algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
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.   DOI   ScienceOn
4 L. A, "Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem", Algorithmica, Vol.33, pp.3-18, 2002.   DOI
5 F. Kuhn. and R. Wattenhofer, "Constant-time distributed dominating set approximation", Distrib. Comput., Vol.17, pp.303-310, 2005.   DOI
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.   DOI   ScienceOn
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.   DOI   ScienceOn
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.