Advertisement

Two Hybrid Meta-heuristic Approaches for Minimum Dominating Set Problem

  • Anupama Potluri
  • Alok Singh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7077)

Abstract

Minimum dominating set, which is an NP-hard problem, finds many practical uses in diverse domains. A greedy algorithm to compute the minimum dominating set is proven to be the optimal approximate algorithm unless P = NP. Meta-heuristics, generally, find solutions better than simple greedy approximate algorithms as they explore the search space better without incurring the cost of an exponential algorithm. However, there are hardly any studies of application of meta-heuristic techniques for this problem. In some applications it is important to minimize the dominating set as much as possible to reduce cost and/or time to perform other operations based on the dominating set. In this paper, we propose a hybrid genetic algorithm and an ant-colony optimization (ACO) algorithm enhanced with local search. We compare the performance of these two hybrid algorithms against the solutions obtained using the greedy heuristic and another hybrid genetic algorithm proposed in literature. We find that the ACO algorithm enhanced with a minimization heuristic performs better than all other algorithms in almost all instances.

Keywords

Ant-Colony Optimization Genetic Algorithm Heuristic Minimum Dominating Set 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. European Journal of Operational Research 94(2), 392–404 (1996)CrossRefzbMATHGoogle Scholar
  2. 2.
    Chvatal, V.: A greedy heuristic for the set covering problem. Mathematics of Operations Research 4(3), 233–235 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)Google Scholar
  4. 4.
    Hedar, A.R., Ismail, R.: Hybrid Genetic Algorithm for Minimum Dominating Set Problem. In: Taniar, D., Gervasi, O., Murgante, B., Pardede, E., Apduhan, B.O. (eds.) ICCSA 2010. LNCS, vol. 6019, pp. 457–467. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. 5.
    Mastrogiovanni, M.: The clustering simulation framework: A simple manual (2007), http://www.michele-mastrogiovanni.net/software/download/README.pdf
  6. 6.
    Medina, A., Lakhina, A., Matta, I., Byers, J.: Brite user manual, http://www.cs.bu.edu/brite/user_manual/node42.html
  7. 7.
    Medina, A., Lakhina, A., Matta, I., Byers, J.: Brite: An approach to universal topology generation. In: Proceedings of the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems, MASCOTS 2001 (2001)Google Scholar
  8. 8.
    Garey, M.R., Johnson, D.S.: Computers and Tractability, A guide to the theory of NP-Completeness. Freeman and Company, New York (1979)zbMATHGoogle Scholar
  9. 9.
    Nieberg, T., Hurink, J.L.: A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 296–306. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Shyu, S.J., Yin, P.Y., Lin, B.M.: An ant colony optimization algorithm for the minimum weight vertex cover problem. Annals of Operation Research 131(1-4), 283–304 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Singh, A., Baghel, A.S.: New metaheuristic approaches for the leaf-constrained minimum spanning tree problem. Asia-Pacific Journal of Operational Research 25(4), 575–589 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Solnon, C., Fenet, S.: A study of aco capabilities for solving the maximum clique problem. Journal of Heuristics 12, 155–180 (2006)CrossRefzbMATHGoogle Scholar
  13. 13.
    Wattenhoffer, R.: Distributed dominating set approximation, http://www.disco.ethz.ch/lectures/ss04/distcomp/lecture/chapter12.pdf
  14. 14.
    Waxman, B.: Routing of multipoint connections. IEEE Journal of Selected Areas in Communication 6(9), 1617–1622 (1988)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Anupama Potluri
    • 1
  • Alok Singh
    • 1
  1. 1.Department of Computer and Information SciencesUniversity of HyderabadHyderabadIndia

Personalised recommendations