Skip to main content
SpringerLink
Log in

Heuristics for Minimum Weight Directed Dominating Set Problem

  • Conference paper
  • First Online:
Futuristic Trends in Networks and Computing Technologies (FTNCT 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1206))

Abstract

For any node-weighted directed graph (digraph), a directed dominating set \(S_{D}\) is a subset of nodes such that every node of the digraph either belongs to \(S_{D}\) or has an arc directed from a node in \(S_{D}\) to itself. The minimum weight directed dominating set problem (MWDDS) seeks a directed dominating set with minimum sum of weights of its constituent nodes. It is an \(\mathcal {NP}\)-hard combinatorial optimization problem which finds applications in modelling a wide variety of directed interactions in complex heterogeneous networks like chemical reaction, metabolic regulation, spread of an infectious disease. In this paper, we present five greedy heuristics to solve MWDDS. To our knowledge, these are the first heuristic approaches for MWDDS. We have also proposed a local search based on redundant node removal to improve the solutions obtained by these greedy heuristics. Performance of these five heuristics were evaluated on a wide range of digraph instances. Computational results show the effectiveness of these heuristics.

The first author acknowledges the support of the Senior Research Fellowship from the Council of Scientific & Industrial Research (CSIR), Government of India.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Albuquerque, M., Vidal, T.: An efficient matheuristic for the minimum-weight dominating set problem. Appl. Soft Comput. 72, 527–538 (2018)

    Article  Google Scholar 

  2. Chaurasia, S.N., Singh, A.: A hybrid evolutionary algorithm with guided mutation for minimum weight dominating set. Appl. Intell. 43(3), 512–529 (2015). https://doi.org/10.1007/s10489-015-0654-1

    Article  Google Scholar 

  3. Garey, M.R., Johnson, D.S.: Computers and intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  4. Habibulla, Y., Zhao, J.-H., Zhou, H.-J.: The directed dominating set problem: generalized leaf removal and belief propagation. In: Wang, J., Yap, C. (eds.) FAW 2015. LNCS, vol. 9130, pp. 78–88. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19647-3_8

    Chapter  Google Scholar 

  5. Jovanovic, R., Tuba, M., Simian, D.: Ant colony optimization applied to minimum weight dominating set problem. In: Proceedings of the 12th WSEAS International Conference on Automatic Control, Modelling and Simulation (ACMOS 2010), pp. 322–326. World Scientific and Engineering Academy and Society (WSEAS), Stevens Point (2010)

    Google Scholar 

  6. Lin, G., Guan, J.: A binary particle swarm optimization for the minimum weight dominating set problem. J. Comput. Sci. Technol. 33(2), 305–322 (2018). https://doi.org/10.1007/s11390-017-1781-4

    Article  MathSciNet  Google Scholar 

  7. Liu, Y., Slotine, J., Barabási, A.: Observability of complex systems. In: Proceedings of the National Academy of Sciences, USA, vol. 110, pp. 2460–2465. National Academy of Sciences, USA (2013)

    Google Scholar 

  8. Molnár Jr., F., Sreenivasan, S., Szymanski, B., Korniss, K.: Minimum dominating sets in scale-free network ensembles. Sci. Rep. 3, 1736 (2013)

    Article  Google Scholar 

  9. Nitash, C., Singh, A.: An artificial bee colony algorithm for minimum weight dominating set. In: 2014 IEEE Symposium on Swarm Intelligence, pp. 1–7. IEEE (2014)

    Google Scholar 

  10. Pang, C., Zhang, R., Zhang, Q., Wang, J.: Dominating sets in directed graphs. Inf. Sci. 180, 3647–3652 (2010)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  12. Takaguchi, T., Hasegawa, T., Yoshida, Y.: Suppressing epidemics on networks by exploiting observer nodes. Phys. Rev. E 90, 012807 (2014)

    Article  Google Scholar 

  13. Wang, H., Zheng, H., Browne, F., Wang, C.: Minimum dominating sets in cell cycle specific protein interaction networks. In: Proceedings of the International Conference on Bioinformatics and Biomedicine (BIBM 2014), pp. 25–30. IEEE (2014)

    Google Scholar 

  14. Wang, Y., Cai, S., Chen, J., Yin, M.: A fast local search algorithm for minimum weight dominating set problem on massive graphs. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI 2018), pp. 1514–1522. IJCAI (2018)

    Google Scholar 

  15. Wuchty, S.: Controllability in protein interaction networks. In: Proceedings of the National Academy of Sciences, USA, vol. 111, pp. 7156–7160. National Academy of Sciences, USA (2014)

    Google Scholar 

  16. Yang, Y., Wang, J., Motter, A.: Network observability transitions. Phys. Rev. Lett. 90, 258701 (2012)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer and Information Sciences, University of Hyderabad, Hyderabad, 500 046, Telangana, India

    Mallikarjun Rao Nakkala & Alok Singh

Authors
  1. Mallikarjun Rao Nakkala
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alok Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alok Singh .

Editor information

Editors and Affiliations

  1. Jaypee University of Information Technology, Waknaghat, Himachal Pradesh, India

    Pradeep Kumar Singh

  2. CDAC, Mohali, India

    Sanjay Sood

  3. Jaypee University of Information Technology, Solan, Himachal Pradesh, India

    Yugal Kumar

  4. Polish Academy of Sciences, Warsaw, Poland

    Marcin Paprzycki

  5. Southern Federal University, Rostov-on-Don, Russia

    Anton Pljonkin

  6. Jiangsu Normal University, Xuzhou, China

    Wei-Chiang Hong

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nakkala, M.R., Singh, A. (2020). Heuristics for Minimum Weight Directed Dominating Set Problem. In: Singh, P., Sood, S., Kumar, Y., Paprzycki, M., Pljonkin, A., Hong, WC. (eds) Futuristic Trends in Networks and Computing Technologies. FTNCT 2019. Communications in Computer and Information Science, vol 1206. Springer, Singapore. https://doi.org/10.1007/978-981-15-4451-4_39

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-4451-4_39

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-4450-7

  • Online ISBN: 978-981-15-4451-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation