@article{Downey2014, 
author = {Rodney G. Downey and Judith Egan and Michael R. Fellows and Frances A. Rosamond and Peter Shaw},
title = {Dynamic Dominating Set and Turbo-Charging Greedy Heuristics},
year = {2014},
journal = {Tsinghua Science and Technology},
volume = {19},
number = {4},
pages = {329-337},
keywords = {kernelization, multivariate algorithms, parameterized algorithms, turbo-charging, heuristics},
url = {https://www.sciopen.com/article/10.1109/TST.2014.6867515},
doi = {10.1109/TST.2014.6867515},
abstract = {The main purpose of this paper is to exposit two very different, but very general, motivational schemes in the art of parameterization and a concrete example connecting them. We introduce a dynamic version of the Dominating Set problem and prove that it is fixed-parameter tractable (FPT). The problem is motivated by settings where problem instances evolve. It also arises in the quest to improve a natural greedy heuristic for the Dominating Set problem.}
}