A New Constant Factor Approximation to Construct Highly FaultTolerant Connected Dominating Set in Unit Disk Graph
 Citation data:

IEEE/ACM Transactions on Networking, ISSN: 10636692, Vol: 25, Issue: 1, Page: 1828
 Publication Year:
 2017
 Repository URL:
 https://digitalcommons.kennesaw.edu/facpubs/3887
 DOI:
 10.1109/tnet.2016.2561901
 Author(s):
 Publisher(s):
 Tags:
 Computer Science; Engineering; Computer Sciences
article description
This paper proposes a new polynomial time constant factor approximation algorithm for a moreadecadelong open NPhard problem, the minimum fourconnected mdominating set problem in unit disk graph (UDG) with any positive integer m ≥ 1 for the first time in the literature. We observe that it is difficult to modify the existing constant factor approximation algorithm for the minimum threeconnected m dominating set problem to solve the minimum fourconnected m dominating set problem in UDG due to the structural limitation of Tutte decomposition, which is the main graph theory tool used by Wang et al. to design their algorithm. To resolve this issue, we first reinvent a new constant factor approximation algorithm for the minimum threeconnected m dominating set problem in UDG and later use this algorithm to design a new constant factor approximation algorithm for the minimum fourconnected m dominating set problem in UDG.