Efficient Approximation Algorithm for Minimum Connected Dominating Set Based on Heap

This paper proposes a greedy approximation algorithm to solve Connected Dominating Set(CDS) problem in connected graphs.It uses ordinary heap to repeatedly select a dominating node and adds it to the tree formed by the determined nodes,so that a dominating tree for the graph is constructed.Its time complexity is analyzed in the average case by calculating the number of the heap operations.Experimental results on random network models show that compared with the existing algorithms,CDS constructed by the proposed algorithm is with smaller size.