We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaod...