Abstract The minimum,disc cover can be used to construct a dominating set on the fly for energy-efficient communications in mobile ad hoc n etworks, but the approach used to compute,the minimum,disc cover proposed in previous studies is computationally relatively expensive. In this p aper, we show that the disc cover problem is in fact a special case of the general �-hull problem. In spite of
... [Show full abstract] being a special case, the disc cover problem is not easier than the general �-hull problem. In addition to applying the existing �-hull algorithm to solve the disc cover problem, we present a simple, yet optimal divide- and-conquer algorithm that constructs the minimum,disc cover for arbitrary