Planar capacitated dominating set is W[1]-hard

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5917 LNCS, Issue , 2009, Pages 50-60

  Bodlaender, Hans L ^a   Lokshtanov, Daniel ^b   Penninkx, Eelko ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

DOMINATING SET PROBLEMS; DOMINATING SETS; GRAPH G; OPEN PROBLEMS; PARAMETERIZED; PLANAR GRAPH; POSITIVE INTEGERS;

GRAPH THEORY;

EID: 72249110092     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11269-0_4     Document Type: Conference Paper

References (13)

1. Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. Algorithmica 33(4), 46-493 (2002)
2. Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating set. J. ACM 51(3), 363-384 (2004)
3. Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM 52(6), 866-893 (2005)
4. Dom, M., Lokshtanov, D., Saurabh, S., Villanger, Y.: Capacitated Domination and Covering: A Parameterized Perspective. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 78-90. Springer, Heidelberg (2008)
5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
6. Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science 410(1), 53-61 (2009)
7. Fiala, J., Golovach, P.A., Kratochvíl, J.: Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover. In: TAMC 2009. LNCS, vol. 5532, pp. 221-230. Springer, Heidelberg (2009)
8. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
9. 2 n nondeterministic bits. J. Comput. Syst. Sci. 72(1), 34-71 (2006)
10. Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Clique-width: on the price of generality. In: The Proceedings of SODA, pp. 825-834 (2009)
11. Fomin, F.V., Thilikos, D.M.: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up. SIAM Journal on Computing 36(2), 281-309 (2006)
12. Guo, J., Niedermeier, R.: Linear Problem Kernels for NP-Hard Problems on Planar Graphs. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 375-386. Springer, Heidelberg (2007)
13. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)