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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. European Journal of Operational Research 94(2), 392–404 (1996)
Chvatal, V.: A greedy heuristic for the set covering problem. Mathematics of Operations Research 4(3), 233–235 (1979)
Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)
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)
Mastrogiovanni, M.: The clustering simulation framework: A simple manual (2007), http://www.michele-mastrogiovanni.net/software/download/README.pdf
Medina, A., Lakhina, A., Matta, I., Byers, J.: Brite user manual, http://www.cs.bu.edu/brite/user_manual/node42.html
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)
Garey, M.R., Johnson, D.S.: Computers and Tractability, A guide to the theory of NP-Completeness. Freeman and Company, New York (1979)
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)
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)
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)
Solnon, C., Fenet, S.: A study of aco capabilities for solving the maximum clique problem. Journal of Heuristics 12, 155–180 (2006)
Wattenhoffer, R.: Distributed dominating set approximation, http://www.disco.ethz.ch/lectures/ss04/distcomp/lecture/chapter12.pdf
Waxman, B.: Routing of multipoint connections. IEEE Journal of Selected Areas in Communication 6(9), 1617–1622 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Potluri, A., Singh, A. (2011). Two Hybrid Meta-heuristic Approaches for Minimum Dominating Set Problem. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2011. Lecture Notes in Computer Science, vol 7077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27242-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-27242-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27241-7
Online ISBN: 978-3-642-27242-4
eBook Packages: Computer ScienceComputer Science (R0)