New heuristic approaches for the dominating tree problem

dc.contributor.author	Sundar, Shyam
dc.contributor.author	Singh, Alok
dc.date.accessioned	2022-03-27T05:58:20Z
dc.date.available	2022-03-27T05:58:20Z
dc.date.issued	2013-11-04
dc.description.abstract	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. © 2013 Elsevier B.V. All rights reserved.
dc.identifier.citation	Applied Soft Computing Journal. v.13(12)
dc.identifier.issn	15684946
dc.identifier.uri	10.1016/j.asoc.2013.07.014
dc.identifier.uri	https://www.sciencedirect.com/science/article/abs/pii/S1568494613002512
dc.identifier.uri	https://dspace.uohyd.ac.in/handle/1/8970
dc.subject	Ant colony optimization algorithm
dc.subject	Artificial bee colony algorithm
dc.subject	Dominating tree
dc.subject	Heuristic
dc.subject	Swarm intelligence
dc.subject	Wireless sensor networks
dc.title	New heuristic approaches for the dominating tree problem
dc.type	Journal. Article
dspace.entity.type

Now showing 1 - 1 of 1