Hybrid genetic algorithm for minimum dominating set problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6019 LNCS, Issue PART 4, 2010, Pages 457-467

  Hedar, Abdel Rahman ^a   Ismail, Rashad ^b  

^a Assiut University   (Egypt)

^b Assiut University   (Egypt)

Author keywords

Genetic algorithm; Graph theory; Hybrid methods; Meta heuristics; Minimum dominating set

Indexed keywords

COMPUTATION THEORY; GRAPH ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS;

CENTRAL PROBLEMS; DESIGN ELEMENTS; FITNESS FUNCTIONS; HYBRID GENETIC ALGORITHMS; HYBRID METHOD; META HEURISTICS; MINIMUM DOMINATING SET; SOLUTION QUALITY;

GENETIC ALGORITHMS;

EID: 77952313208     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12189-0_40     Document Type: Conference Paper

References (20)

1. Baker, J.E.: Adaptive selection methods for genetic algorithms. In: Grefenstette, J.J. (ed.) Proceedings of the First International Conference on Genetic Algorithms, pp. 101-111. Lawrence Erlbaum Associates, Hillsdale (1985)
2. Burke, E.K., Kendall, G.: Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Springer, Berlin (2005)
3. Carey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-Completeness. Freeman, New York (1979)
4. Cooper, C., Klasing, R., Zito, M.: Lower bounds and algorithms for dominating sets in web graphs. Internet Math. 2, 275-300 (2005)
5. Engelbrecht, A.P.: Computational Intelligence: An Introduction. John Wiley & Sons, Chichester (2003)
6. Fomin, F.V., Thilikos, D.M.: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. SIAM J. Computing 36, 281-309 (2006)
7. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)
8. Grandoni, F.: A note on the complexity of minimum dominating set. J. Discrete Algorithms 4, 209-214 (2006)
9. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in graphs. Monographs and Textbooks in Pure and Applied Mathematics. Marcel Dekker, New York (1998)
10. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of domination in graphs. Monographs and Textbooks in Pure and Applied Mathematics. Marcel Dekker, New York (1998)
11. Herrera, F., Lozano, M., Verdegay, J.L.: Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis. Artificial Intelligence Review 12, 265-319 (1998)
12. Ho, C.K., Ewe, H.T.: A hybrid ant colony optimization approach (hACO) for constructing load-balanced clusters. In: IEEE Congress on Evolutionary Computation, pp. 2010-2017 (2005)
13. Ho, C.K., Singh, Y.P., Ewe, H.T.: An enhanced ant colony optimization metaheuristic for the minimum dominating set problem. Applyed Artificial Intelligence 20, 881-903 (2006)
14. Holland, J.: Adaptation in Natural and Artifical Systems. University of Michigan Press, Ann Arbor (1975)
15. Konar, A.: Computational Intelligence: Principles, Techniques and Applications. Springer, Berlin (2005)
16. Korobitsyn, D.V.: On the complexity of determining the domination number in monogenic classes of graphs. Diskret. Mat. 2, 90-96 (1990); in Russian, translation in Discrete Mathematics and Applications 2, 191-199 (1992)
17. Lozin, V., Milan íc, M.: Domination in Graphs of Low Degree. Rutcor Research Report (RRR) New Jersey 27 (2006)
18. Müller, H., Brandstädt, A.: NP-completeness of STEINER TREE and DOMINATING SET for chordal bipartite graphs. Theoretical Computer Science 53, 257-265 (1987)
19. Samuel, H., Zhuang, W.: DTN Based Dominating Set Routing for MANET in Heterogeneous Wireless Networking 14, 154-164 (2009), Springer
20. Tettamanzi, A., Tomassini, M., Janben, J.: Soft computing: integrating evolutionary, neural, and fuzzy systems. Springer, Berlin (2001)