Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computational Science and Its Applications

ICCSA 2010: Computational Science and Its Applications – ICCSA 2010 pp 457–467Cite as

Hybrid Genetic Algorithm for Minimum Dominating Set Problem

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6019))

Abstract

The minimum dominating set (MDS) problem is one of the central problems of algorithmic graph theory and has numerous applications especially in graph mining. In this paper, we propose a new hybrid method based on genetic algorithm (GA) to solve the MDS problem, called shortly HGA-MDS. The proposed method invokes a new fitness function to effectively measure the solution qualities. The search process in HGA-MDS uses local search and intensification schemes beside the GA search methodology in order to achieve faster performance. Finally, the performance of the HGA-MDS is compared with the standard GA. The new invoked design elements in HGA-MDS show its promising performance compared with standard GA.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Google Scholar 

  2. Burke, E.K., Kendall, G.: Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques. Springer, Berlin (2005)

    MATH  Google Scholar 

  3. Carey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-Completeness. Freeman, New York (1979)

    Google Scholar 

  4. Cooper, C., Klasing, R., Zito, M.: Lower bounds and algorithms for dominating sets in web graphs. Internet Math. 2, 275–300 (2005)

    MATH  MathSciNet  Google Scholar 

  5. Engelbrecht, A.P.: Computational Intelligence: An Introduction. John Wiley & Sons, Chichester (2003)

    Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  7. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  8. Grandoni, F.: A note on the complexity of minimum dominating set. J. Discrete Algorithms 4, 209–214 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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)

    Google Scholar 

  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)

    Article  Google Scholar 

  14. Holland, J.: Adaptation in Natural and Artifical Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  15. Konar, A.: Computational Intelligence: Principles, Techniques and Applications. Springer, Berlin (2005)

    MATH  Google Scholar 

  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)

    MATH  Google Scholar 

  17. Lozin, V., Milanič, M.: Domination in Graphs of Low Degree. Rutcor Research Report (RRR) New Jersey 27 (2006)

    Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

  19. Samuel, H., Zhuang, W.: DTN Based Dominating Set Routing for MANET in Heterogeneous Wireless Networking 14, 154–164 (2009), Springer

    Google Scholar 

  20. Tettamanzi, A., Tomassini, M., Janben, J.: Soft computing: integrating evolutionary, neural, and fuzzy systems. Springer, Berlin (2001)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Faculty of Computers and Information, Assiut University, Assiut, 71516, Egypt

    Abdel-Rahman Hedar

  2. Dept. of Mathematics, Faculty of Science, Assiut University, Assiut, 71516, Egypt

    Rashad Ismail

Authors
  1. Abdel-Rahman Hedar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rashad Ismail
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Clayton School of Information Technology, Monash University, VIC 3800, Clayton, Australia

    David Taniar

  2. Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli, 1, 06123, Perugia, Italy

    Osvaldo Gervasi

  3. L.I.S.U.T. - D.A.P.I.T., University of Basilicata, Viale dell’Ateneo Lucano 10, 85100, Potenza, Italy

    Beniamino Murgante

  4. Department of Computer Science and Computer Engineeering, LaTrobe University, VIC 3086, Bundoora, Australia

    Eric Pardede

  5. Department of Intelligent Informatics, Kyushu Sangyo University, 813-8503, Fukuoka, Japan

    Bernady O. Apduhan

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hedar, AR., Ismail, R. (2010). Hybrid Genetic Algorithm for Minimum Dominating Set Problem. In: Taniar, D., Gervasi, O., Murgante, B., Pardede, E., Apduhan, B.O. (eds) Computational Science and Its Applications – ICCSA 2010. ICCSA 2010. Lecture Notes in Computer Science, vol 6019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12189-0_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12189-0_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12188-3

  • Online ISBN: 978-3-642-12189-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation