Two hybrid meta-heuristic approaches for minimum dominating set problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7077 LNCS, Issue PART 2, 2011, Pages 97-104

  Potluri, Anupama ^a   Singh, Alok ^a  

^a UNIVERSITY OF HYDERABAD   (India)

Author keywords

Ant Colony Optimization; Genetic Algorithm; Heuristic; Minimum Dominating Set

Indexed keywords

ACO ALGORITHMS; ANT COLONY OPTIMIZATION ALGORITHM; ANT-COLONY OPTIMIZATION; APPROXIMATE ALGORITHMS; DIVERSE DOMAINS; DOMINATING SETS; EXPONENTIAL ALGORITHMS; GREEDY ALGORITHMS; GREEDY HEURISTICS; HEURISTIC; HYBRID ALGORITHMS; HYBRID GENETIC ALGORITHMS; LOCAL SEARCH; META HEURISTICS; META-HEURISTIC APPROACH; META-HEURISTIC TECHNIQUES; MINIMUM DOMINATING SET; NP-HARD PROBLEM; SEARCH SPACES; ANT COLONY OPTIMIZATION ALGORITHMS; HYBRID META-HEURISTIC;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; ANT COLONY OPTIMIZATION; NP-HARD;

HEURISTIC ALGORITHMS;

EID: 84555217875     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-27242-4_12     Document Type: Conference Paper

References (14)

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)
2. Chvatal, V.: A greedy heuristic for the set covering problem. Mathematics of Operations Research 4(3), 233-235 (1979)
3. Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)
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)
5. Mastrogiovanni, M.: The clustering simulation framework: A simple manual (2007), http://www.michele-mastrogiovanni.net/software/download/README.pdf
6. Medina, A., Lakhina, A., Matta, I., Byers, J.: Brite user manual, http://www.cs.bu.edu/brite/user-manual/node42.html
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)
8. Garey, M.R., Johnson, D.S.: Computers and Tractability, A guide to the theory of NP-Completeness. Freeman and Company, New York (1979)
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) (Pubitemid 43987064)
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)
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)
12. Solnon, C., Fenet, S.: A study of aco capabilities for solving the maximum clique problem. Journal of Heuristics 12, 155-180 (2006)
13. Wattenhoffer, R.: Distributed dominating set approximation, http://www.disco.ethz.ch/lectures/ss04/distcomp/lecture/chapter12.pdf
14. Waxman, B.: Routing of multipoint connections. IEEE Journal of Selected Areas in Communication 6(9), 1617-1622 (1988)