Improved Algorithms and Complexity Results for Power Domination in Graphs
The Power Dominating Set problem is a variant of the classical domination problem in graphs: Given an undirected graph G=(V,E), find a minimum P ⊆ V such that all vertices in V are “observed” by vertices in P. Herein, a vertex observes itself and all its neighbors, and if an observed vertex has all but one of its neighbors observed, then the remaining neighbor becomes observed as well. We show that Power Dominating Set can be solved by “bounded-treewidth dynamic programs.” Moreover, we simplify and extend several NP-completeness results, particularly showing that Power Dominating Set remains NP-complete for planar graphs, for circle graphs, and for split graphs. Specifically, our improved reductions imply that Power Dominating Set parameterized by |P| is W-hard and cannot be better approximated than Dominating Set.
Unable to display preview. Download preview PDF.
- 4.Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)Google Scholar
- 5.Demaine, E.D., Hajiaghayi, M.: Bidimensionality: New connections between FPT algorithms and PTASs. In: Proc. 16th SODA, pp. 590–601 (2005)Google Scholar
- 6.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
- 10.Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: Parameterized power domination complexity. Technical Report AIB-2004-09, In: Department of Computer Science, RWTH Aachen (December 2004)Google Scholar
- 11.Kratsch, D.: Algorithms. In: Haynes, T.W., Hedetniemi, S.T., Slater, P.J. (eds.) Domination in Graphs: Advanced Topics, pp. 191–231. Marcel Dekker, New York (1998)Google Scholar
- 12.Telle, J.A., Proskurowski, A.: Practical algorithms on partial k-trees with an application to domination-like problems. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1993. LNCS, vol. 709, pp. 610–621. Springer, Heidelberg (1993)Google Scholar