Computing and Informatics

In this paper, we study the Dominating Set problem with measure functions, which is extended from the general Dominating Set problem. We study the correspondnig problems on complexity, approximation and inapproximability for Dominating Set problem with measure functions. In addition, we extend our results to the weighted graphs.