A greedy heuristic and its variants for minimum capacitated dominating set

Abstract

The Minimum Capacitated Dominating Set (CAPMDS) problem is the problem of finding a dominating set of minimum cardinality with the additional constraint that the nodes dominated do not exceed the capacity of the dominating node. The capacity can be uniform across all nodes or variable. Being a generalization of the Minimum Dominating Set problem, this problem also -hard. In this paper, we present a heuristic and a couple of its variants for solving the CAPMDS problem. Our heuristics work for both uniform and variable capacity graphs. We show that the heuristic proposed is better than the variants, in general. However, for Unit Disk Graphs with high degree of connectivity and uniform capacity, one of the variants performs better. For general graphs, the proposed heuristic is far superior to the variants. © 2012 Springer-Verlag.