An Optimal Algorithm for The Minimum Disc Cover Problem

The minimum disc cover can be used to construct a dominating set onthe fly for energy-efficient communications in mobile ad hoc networks, butthe approach used to compute the minimum disc cover proposed in previousstudies is computationally relatively expensive. In this paper, we show thatthe disc cover problem is in fact a special case of the general -hull problem.In spite of..