Subexponential algorithms for partial cover problems

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 4, Issue , 2009, Pages 193-201

  Fomin, Fedor V ^a   Lokshtanov, Daniel ^a   Raman, Venkatesh ^b   Saurabh, Saket ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL PROBLEMS; DOMINATING SET PROBLEMS; DOMINATING SETS; PARAMETERIZED; PARAMETERIZED COMPLEXITY; PARTIAL COVER; SUB-EXPONENTIAL ALGORITHMS; SUBEXPONENTIAL TIME;

ALGORITHMS; GRAPH THEORY; GRAPHIC METHODS; SOFTWARE ENGINEERING;

PROBLEM SOLVING;

EID: 77955032066     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2009.2318     Document Type: Conference Paper

References (31)

1. O. Amini, F. V. Fomin, and S. Saurabh. Implicit branching and parameterized partial cover problems (extended abstract). In FSTTCS, 2008.
2. S. Arora and G. Karakostas. A 2+epsilon approximation algorithm for the-mst problem. In SODA, pages 754-759, 2000.
3. R. Bar-Yehuda. Using homogenous weights for approximating the partial cover problem. In SODA, pages 71-75, 1999.
4. M. Bläser. Computing small partial coverings. Inf. Process. Lett., 85(6): 327-331, 2003.
5. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. In SODA, pages 642-651, 2001.
6. E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos. Bidimensional parameters and local treewidth. SIAM J. Discrete Math., 18(3): 501-511, 2004.
7. E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos. Subexponential parameterized algorithms on bounded-genus graphs and -minor-free graphs. J. ACM, 52(6): 866-893, 2005.
8. E. D. Demaine and M. Hajiaghayi. Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica, 28(1): 19-36, 2008.
9. E. D. Demaine and M. T. Hajiaghayi. Bidimensionality: new connections between fpt algorithms and ptass. In SODA, pages 590-601, 2005.
10. E. D. Demaine and M. T. Hajiaghayi. The bidimensionality theory and its algorithmic applications. Computer Journal, 51(3): 292-302, 2008.
11. E. D. Demaine, M. T. Hajiaghayi, and K. Kawarabayashi. Algorithmic graph minor theory: Decomposition, approximation, and coloring. In FOCS, pages 637-646, 2005.
12. F. Dorn, F. V. Fomin, and D. M. Thilikos. Subexponential parameterized algorithms. Computer Science Review, 2(1): 29-39, 2008.
13. R. G. Downey and M. R. Fellows. Parameterized complexity. Springer-Verlag, New York, 1999.
14. J. Flum and M. Grohe. Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin, 2006.
15. F. V. Fomin, P. A. Golovach, and D. M. Thilikos. Contraction bidimensionality: the accurate picture. In ESA 09, LNCS, Berlin Heidelberg, 2009. Springer-Verlag.
16. R. Gandhi, S. Khuller, and A. Srinivasan. Approximation algorithms for partial covering problems. J. Algorithms, 53(1): 55-84, 2004.
17. J. Guo, R. Niedermeier, and S. Wernicke. Parameterized complexity of vertex cover variants. Theory Comput. Syst., 41(3): 501-520, 2007.
18. E. Halperin and A. Srinivasan. Improved approximation algorithms for the partial vertex cover problem. In K. Jansen, S. Leonardi, and V. V. Vazirani, editors, APPROX, Volume 2462 of Lecture Notes in Computer Science, pages 161-174. Springer, 2002.
19. K. Kawarabayashi. An improved algorithm for finding cycles through elements. In IPCO, Volume 5035 of Lecture Notes in Computer Science, pages 374-384, 2008.
20. K. Kawarabayashi and Y. Kobayashi. The induced disjoint paths problem. In IPCO, Volume 5035 of Lecture Notes in Computer Science, pages 47-61, 2008.
21. K. Kawarabayashi and B. A. Reed. A nearly linear time algorithm for the half integral disjoint paths packing. In SODA, pages 446-454, 2008.
22. K. Kawarabayashi and B. A. Reed. A nearly linear time algorithm for the half integral parity disjoint paths packing problem. In SODA, pages 1183-1192, 2009.
23. J. Kneis, A. Langer, and P. Rossmanith. Improved upper bounds for partial vertex cover. In WG, Volume 5344 of Lecture Notes in Computer Science, pages 240-251, 2008.
24. J. Kneis, D. Mölle, S. Richter, and P. Rossmanith. Intuitive algorithms and t-vertex cover. In ISAAC, Volume 4288 of Lecture Notes in Computer Science, pages 598-607, 2006.
25. J. Kneis, D. Mölle, and P. Rossmanith. Partial vs. complete domination: t-dominating set. In SOFSEM (1), Volume 4362 of Lecture Notes in Computer Science, pages 367-376, 2007.
26. Y. Kobayashi and K. Kawarabayashi. Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. In SODA, pages 1146-1155, 2009.
27. I. Koutis and R. William. Limits and applications of group algebras for parameterized problems. In ICALP 09, LNCS, Berlin Heidelberg, 2009. Springer-Verlag.
28. H. Moser. Exact Algorithms for Generalizations of Vertex Cover. Master's thesis, Insti-tut für Informatik, Friedrich-Schiller-Universität Jena, Germany, 2005.
29. R. Niedermeier. Invitation to fixed-parameter algorithms, Volume 31 of Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, Oxford, 2006.
30. N. Robertson, P. Seymour, and R. Thomas. Quickly excluding a planar graph. Journal of Combinatorial Theory Series B, 62: 323-348, 1994.
31. N. Robertson and P. D. Seymour. Graph minors.xiii. the disjoint paths problem. J. Comb. Theory, Ser. B, 63(1): 65-110, 1995.