scholar.google.com › citations
Definition 2 We call D ⊆ V a capacitated dominating set if there exists a mapping f : (V \ D) → D which maps every vertex in (V \ D) to one of its neighbors such that the total number of vertices mapped by f to any vertex v ∈ D does not exceed c(v).
Apr 15, 2016 · 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 ...
Apr 15, 2016 · Abstract. Capacitated Domination generalizes the classic Dominating Set problem by specifying for each vertex a required demand and ...
Given a graph G together with a capacity function c : V (G) → N, we call. S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S.
Given a graph G together with a capacity function c : V(G) →ℕ, we call S ⊆ V(G) a capacitated dominating set if there exists a mapping f: (V(G) ∖ S) →S ...
In the Planar Capacitated Dominating Set problem we are given a planar graph G , a capacity function c and a positive integer k and asked whether G has a ...
This paper shows that Planar Capacitated Dominating Set is W[1]-hard, resolving an open problem of Dom et al. Given a graph G together with a capacity ...
Abstract. We consider the capacitated domination problem, which mod- els a service-requirement assigning scenario and which is also a general-.
Given a graph G together with a capacity function c : V(G) →ℕ, we call S ⊆ V(G) a capacitated dominating set if there exists a mapping f: (V(G) ∖ S) →S ...
May 11, 2014 · The Capacitated Dominating Set problem is the problem of finding a dominating set of minimum cardinality where each vertex has been assigned a bound on the ...