Approximating the tree and tour covers of a graph
Information Processing Letters
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
On approximability of the independent/connected edge dominating set problems
Information Processing Letters
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
IEEE Transactions on Mobile Computing
A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
On the performance of artificial bee colony (ABC) algorithm
Applied Soft Computing
Journal of Global Optimization
Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
On Construction of Virtual Backbone in Wireless Ad Hoc Networks with Unidirectional Links
IEEE Transactions on Mobile Computing
New Approximation for Minimum-Weight Routing Backbone in Wireless Sensor Network
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem
Applied Soft Computing
A survey: algorithms simulating bee swarm intelligence
Artificial Intelligence Review
A swarm intelligence approach to the quadratic minimum spanning tree problem
Information Sciences: an International Journal
A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem
Information Sciences: an International Journal
How to trim an MST: a 2-approximation algorithm for minimum cost tree cover
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.00 |
Given an undirected, connected and edge-weighted graph, the dominating tree problem (DTP) seeks on this graph a tree with minimum total edge weight such that each vertex of the graph is either in this tree or adjacent to a vertex in this tree. The DTP is a NP-Hard problem. In the literature only two heuristics for this problem are proposed so far in spite of the fact that it has several practical applications in the field of wireless sensor networks. In this paper, we propose one heuristic and two swarm intelligence techniques, viz. an artificial bee colony algorithm and an ant colony optimization algorithm for the DTP. Computational results show the effectiveness of our approaches.