Skip to main content
SpringerLink
Log in

A Fast Metaheuristic for Finding the Minimum Dominating Set in Graphs

  • Conference paper
  • First Online:
Metaheuristics (MIC 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13838))

Included in the following conference series:

  • 469 Accesses

Abstract

Finding minimum dominating sets in graphs is a problem that has been widely studied in the literature. However, due to the increase in the size and complexity of networks, new algorithms with the ability to provide high quality solutions in short computing times are desirable. This work presents a Greedy Randomized Adaptive Search Procedure for dealing with the Minimum Dominating Set Problem in large networks. The algorithm is conformed by an efficient constructive procedure to generate promising initial solutions and a local search designed to find a local optimum with respect to those initial solutions. The experimental results show the competitiveness of the proposed algorithm when comparing it with the state-of-the-art methods.

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

Access this chapter

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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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

Institutional subscriptions

References

  1. Chalupa, D.: An order-based algorithm for minimum dominating set with application in graph mining. Inf. Sci. 426, 101–116 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  2. De Jaenisch, C.F.: Applications de l’Analuse mathematique an Jen des Echecs. Petrograd (1862)

    Google Scholar 

  3. Erwin, D.: Dominating broadcasts in graphs. Int. J. Comput. Eng. Technol. 42, 89–105 (2004)

    MathSciNet  MATH  Google Scholar 

  4. Feo, T.A., Resende, M.G.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2), 67–71 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  5. Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discret. Math. 15(4), 519–529 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. CRC Press, Boca Raton (2013)

    Book  MATH  Google Scholar 

  7. Haynes, T.W., Hedetniemi, S.T., Henning, M.A.: Structures of Domination in Graphs. Springer, Heidelberg (2021). https://doi.org/10.1007/978-3-030-58892-2

    Book  MATH  Google Scholar 

  8. Haynes, T.: Domination in Graphs: Volume 2: Advanced Topics. Routledge (2017)

    Google Scholar 

  9. Lozano-Osorio, I., Sánchez-Oro, J., Duarte, A., Cordón, Ó.: A quick grasp-based method for influence maximization in social networks. J. Ambient Intell. Human. Comput. 1–13 (2021)

    Google Scholar 

  10. Ore, O.: Theory of Graphs. AMS, Providence (1962)

    Book  MATH  Google Scholar 

  11. Potluri, A., Singh, A.: Hybrid metaheuristic algorithms for minimum weight dominating set. Appl. Soft Comput. 13, 76–88 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad Rey Juan Carlos, Mostoles, Spain

    Alejandra Casado & Jesús Sánchez-Oro

  2. Universidad Pablo de Olavide, Seville, Spain

    Sergio Bermudo & Ana Dolores López-Sánchez

Authors
  1. Alejandra Casado
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergio Bermudo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ana Dolores López-Sánchez
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jesús Sánchez-Oro
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jesús Sánchez-Oro .

Editor information

Editors and Affiliations

  1. University of Udine, Udine, Italy

    Luca Di Gaspero

  2. University of Napoli - Federico II, Napoli, Italy

    Paola Festa

  3. University of Paris Est, Paris, France

    Amir Nakib

  4. University of Catania, Catania, Italy

    Mario Pavone

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Casado, A., Bermudo, S., López-Sánchez, A.D., Sánchez-Oro, J. (2023). A Fast Metaheuristic for Finding the Minimum Dominating Set in Graphs. In: Di Gaspero, L., Festa, P., Nakib, A., Pavone, M. (eds) Metaheuristics. MIC 2022. Lecture Notes in Computer Science, vol 13838. Springer, Cham. https://doi.org/10.1007/978-3-031-26504-4_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-26504-4_47

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-26503-7

  • Online ISBN: 978-3-031-26504-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation