Abstract:In this article, we consider the problem of computing minimum dominating set for a given set S of n points in R 2 . Here the objective is to find a minimum cardinality subset S ′ of S such that the union of the unit radius disks centered at the points in S ′ covers all the points in S. We first propose a simple 4-factor and 3-factor approximation algorithms in O(n 6 log n) and O(n 11 log n) time respectively improving time complexities by a factor of O(n 2 ) and O(n 4 ) respectively over the best known result … Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.