Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory

DOI10.1142/S0129054115500434zbMath1346.68259MaRDI QIDQ3455753

Javad Akbari Torkestani

Publication date: 11 December 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

learning automataconnected dominating setSteiner connected dominating set

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (1)

DEGREE-CONSTRAINED MINIMUM SPANNING TREE PROBLEM IN STOCHASTIC GRAPH

Cites Work

• A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
• Clustering the wireless ad hoc networks: a distributed learning automata approach
• An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata
• Unit disk graphs
• Approximation algorithms for connected dominating sets
• Approximation schemes for covering and packing problems in image processing and VLSI
• Learning Optimal Discriminant Functions through a Cooperative Game of Automata
• Simple heuristics for unit disk graphs
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS

This page was built for publication: Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory