Capacitated Dominating Set on Planar Graphs

  title={Capacitated Dominating Set on Planar Graphs},
  author={Amariah Becker},
Capacitated Domination generalizes the classic Dominating Set problem by specifying for each vertex a required demand and an available capacity for covering demand in its closed neighborhood. The objective is to find a minimum-sized set of vertices that can cover all of the graph’s demand without exceeding any of the capacities. In this paper we look specifically at domination with hard-capacities, where the capacity and cost of a vertex can contribute to the solution at most once. Previous… CONTINUE READING
Twitter Mention


Publications citing this paper.

Similar Papers

Loading similar papers…