Sciweavers

89
Voted
IWPEC
2009
Springer
15 years 3 months ago
Planar Capacitated Dominating Set Is W[1]-Hard
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 which maps every...
Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penni...