We provide parameterized algorithms for NONBLOCKER, the parametric dual of the well known DOMINATING SET problem. We exemplify three methodologies for deriving parameterized algorithms that can be used in other circumstances as well, including the (i) use of extremal combinatorics (known results from graph theory) in order to obtain very small kernels, (ii) use of known exact algorithms for the (nonparameterized) MINIMUM DOMINATING SET problem, and (iii) use of exponential space. Parameterized by the size kd of the non-blocking set, we obtain an algorithm that runs in time Ο* (1.4123kd) when allowing exponential space.

Additional Metadata
Persistent URL dx.doi.org/10.1007/11611257_21
Dehne, F, Fellows, M. (Michael), Fernau, H. (Henning), Prieto, E. (Elena), & Rosamond, F. (Frances). (2006). Nonblocker: Parameterized algorithmics for minimum dominating set. doi:10.1007/11611257_21