Approximating the minimum connected dominating set in stochastic graphs based on learning automata

Proceedings - 2009 International Conference on Information Management and Engineering, ICIME 2009

Volumn , Issue , 2009, Pages 672-676

  Torkestani, J Akbari ^a   Meybodi, M R ^b  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

^b AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Dominating set; Learning automata; Minimum connected dominating set; Stochastic graph

Indexed keywords

ARBITRARY GRAPHS; DOMINATING SET; GRAPH G; LEARNING AUTOMATA; MINIMUM CONNECTED DOMINATING SET; NP-HARD PROBLEM; SIMULATION RESULT; STOCHASTIC GRAPH; STOCHASTIC GRAPHS; VERTEX- WEIGHTS;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISTRIBUTION FUNCTIONS; EDUCATION; INFORMATION MANAGEMENT; LEARNING ALGORITHMS; PROBLEM SOLVING; ROBOTS; SET THEORY; TRANSLATION (LANGUAGES);

GRAPH THEORY;

EID: 70349480943     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIME.2009.133     Document Type: Conference Paper

References (6)

1. B. N. Clark, C. J. Colbourn, and D. S. Johnson, "Unit Disk Graphs, " Discrete Mathematics, Vol. 86, pp. 165-177. 1990.
2. K. R. Hutson, and, D. R. Shier, "Minimum Spanning Trees in Networks with Varying Edge Weights", Annals of Operations Research, Springer, Vol. 146 pp. 3-18, 2006.
3. F. B. ALT, "Bonferroni Inequalities and Intervals", in Encyclopedia of Statistical Sciences", Vol. 1, pp. 294-301, 1982.
4. C. E. Bonferroni, "Teoria Statistica Delle Classi e Calcolo Delle Probabilità", Pubblicazioni del R Istituto Superiore di Scienze Economiche e Commerciali di Firenze, Vol. 8, pp. 3-62, 1936.
5. K. S. Narendra and K. S. Thathachar, "Learning Automata: An Introduction", New York, Printice-Hall, 1989.
6. M. A. L. Thathachar and B. R. Harita, "Learning Automata with Changing Number of Actions", IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMG17, 1987, pp. 1095-1100.