Capacitated domination and covering: A parameterized perspective

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

Volumn 5018 LNCS, Issue , 2008, Pages 78-90

  Dom, Michael ^a   Lokshtanov, Daniel ^b   Saurabh, Saket ^b   Villanger, Yngve ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; PARAMETERIZATION; POLYNOMIALS; PROBLEM SOLVING;

CAPACITATED DOMINATING SET; CAPACITATED VERTEX COVER; TREEWIDTH;

SET THEORY;

EID: 44649189947     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79723-4_9     Document Type: Conference Paper

References (22)

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), 461-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. Bläser, M.: Computing small partial coverings. Inf. Process. Lett. 85(6), 327-331 (2003)
4. Chen, J., Kanj, I.A., Xia, G.: Improved parameterized upper bounds for Vertex Cover. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 238-249. Springer, Heidelberg (2006)
5. Chuzhoy, J., Naor, J.: Covering problems with hard capacities. SIAM J. Comput. 36(2), 498-515 (2006)
6. Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs andH-minor-free graphs. J. ACM 52(6), 866-893 (2005)
7. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
8. Duh, R., Fürer, M.: Approximation of k-Set Cover by semi-local optimization. In: Proc. 29th STOC, pp. 256-264. ACM Press, New York (1997)
9. Feige, U.: A threshold of ln n for approximating Set Cover. J. ACM 45(4), 634-652 (1998)
10. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
11. Fomin, F.V., Thilikos, D.M.: Dominating sets in planar graphs: Branch-width and exponential speed-up. SIAM J. Comput. 36(2), 281-309 (2006)
12. Gandhi, R., Halperin, E., Khuller, S., Kortsarz, G., Srinivasan, A.: An improved approximation algorithm for Vertex Cover with hard capacities. J. Comput. System Sci. 72(1), 16-33 (2006)
13. Guha, S., Hassin, R., Khuller, S., Or, E.: Capacitated vertex covering. J. Algorithms 48(1), 257-270 (2003)
14. 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)
15. Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of Vertex Cover variants. Theory Comput. Syst. 41(3), 501-520 (2007)
16. Kloks, T.: Treewidth. LNCS, vol. 842. Springer, Heidelberg (1994)
17. Lovàsz, L.: On the ratio of optimal fractional and integral covers. Discrete Math. 13, 383-390 (1975)
18. Mölle, D., Richter, S., Rossmanith, P.: Enumerate and expand: Improved algorithms for Connected Vertex Cover and Tree Cover. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 270-280. Springer, Heidelberg (2006)
19. Moser, H.: Exact algorithms for generalizations of Vertex Cover. Diploma thesis, Institut für Informatik, Friedrich-Schiller Universität Jena (2005)
20. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
21. Nishimura, N., Ragde, P., Thilikos, D.M.: Fast fixed-parameter tractable algorithms for nontrivial generalizations of Vertex Cover. Discrete Appl. Math. 152(1-3), 229-245 (2005)
22. Raman, V., Saurabh, S.: Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles. Algorithmica (to appear, 2008)