Hitting forbidden minors: Approximation and Kernelization

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 9, Issue , 2011, Pages 189-200

  Fomin, Fedor V ^a   Lokshtanov, Daniel ^b   Misra, Neeldhara ^c   Philip, Geevarghese ^c   Saurabh, Saket ^c  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; FEEDBACK VERTEX SET; FIXED INTEGERS; INDUCED SUBGRAPHS; OPTIMAL SOLUTIONS; POLYNOMIAL KERNELS; TOPOLOGICAL GRAPHS; UNDIRECTED GRAPH;

APPROXIMATION ALGORITHMS; COMPUTER SCIENCE;

GRAPH THEORY;

EID: 84880292795     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2011.189     Document Type: Conference Paper

References (34)

1. F. N. Abu-Khzam, M. R. Fellows, M. A. Langston, and W. H. Suters. Crown structures for vertex cover kernelization. Theory Comput. Syst., 41(3):411-430, 2007.
2. I. Adler, M. Grohe, and S. Kreutzer. Computing excluded minors. In SODA, pages 641-650, 2008.
3. N. Alon, G. Gutin, E. J. Kim, S. Szeider, and A. Yeo. Solving max-r-sat above a tight lower bound. In SODA, pages 511-517. ACM-SIAM, 2010.
4. V. Bafna, P. Berman, and T. Fujito. A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discr. Math., 12(3):289-297, 1999.
5. R. Bar-Yehuda and S. Even. A linear-time approximation algorithm for the weighted vertex cover problem. J. Algorithms, 2(2):198-203, 1981.
6. H. L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25(6):1305-1317, 1996.
7. H. L. Bodlaender. A cubic kernel for feedback vertex set. In STACS, Volume 4393 of Lecture Notes In Comput. Sci., pages 320-331. Springer, 2007.
8. H. L. Bodlaender. Kernelization: New upper and lower bound techniques. In IWPEC, Volume 5917 of Lecture Notes In Computer Science, pages 17-37. Springer, 2009.
9. H. L. Bodlaender, R. G. Downey, M. R. Fellows, and D. Hermelin. On problems without polynomial kernels. J. Comput. Syst. Sci., 75(8):423-434, 2009.
10. H. L. Bodlaender, F. V. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh, and D. M. Thilikos. (Meta) Kernelization. In FOCS, pages 629-638. IEEE, 2009.
11. H. L. Bodlaender, S. Thomassé, and A. Yeo. Kernel Bounds for Disjoint Cycles and Disjoint Paths. In ESA, Volume 5757 of Lecture Notes In Comput. Sci., pages 635-646. Springer, 2009.
12. K. Burrage, V. Estivill Castro, M. R. Fellows, M. A. Langston, S. Mac, and F. A. Rosamond. The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel. In IWPEC, Volume 4169 of Lecture Notes In Comput. Sci., pages 192-202. Springer, 2006.
13. J. Chen, I. A. Kanj, and W. Jia. Vertex cover: further observations and further improvements. J. Algorithms, 41(2):280-301, 2001.
14. 2) steps. In WG, Volume 3353 of LNCS, pages 257-269. Springer, 2004.
15. B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit disk graphs. Discrete Math., 86(1-3):165-177, 1990.
16. M. Cygan, M. Pilipczuk, M. Pilipczuk, and J. O. Wojtaszczyk. Improved fpt algorithm and quadratic kernel for pathwidth one vertex deletion. In IPEC, Volume 6478 of Lecture Notes In Comput. Sci., pages 95-106. Springer, 2010.
17. H. Dell and D. van Melkebeek. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In STOC, pages 251-260. ACM, 2010.
18. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1998.
19. P. Erdos and L. Pósa. On independent circuits contained in a graph. Canadian J. Math., 17:347-352, 1965.
20. S. Fiorini, G. Joret, and U. Pietropaoli. Hitting diamonds and growing cacti. In IPCO 2010, Volume 6080 of Lecture Notes In Comput. Sci., pages 191-204. Springer, 2010.
21. J. Flum and M. Grohe. Parameterized Complexity Theory. Texts In Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin, 2006.
22. F. V. Fomin, D. Lokshtanov, S. Saurabh, and D. M. Thilikos. Bidimensionality and kernels. In SODA, pages 503-510. ACM-SIAM, 2010.
23. L. Fortnow and R. Santhanam. Infeasibility of instance compression and succinct PCPs for NP. In STOC, pages 133-142. ACM, 2008.
24. J. Guo and R. Niedermeier. Invitation to data reduction and problem kernelization. ACM SIGACT News, 38(1):31-45, 2007.
25. P. G. Kolaitis and M. N. Thakur. Approximation properties of NP minimization classes. J. Comput. System Sci., 50:391-411, 1995.
26. 1 and MAX NP. In STACS, Volume 3 of (LIPIcs), pages 601-612. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2009.
27. J. M. Lewis and M. Yannakakis. The node-deletion problem for hereditary properties is NP-complete. J. of Comp. System Sci., 20(2):219-230, 1980.
28. C. Lund and M. Yannakakis. The approximation of maximum subgraph problems. In ICALP, Volume 700 of Lecture Notes In Comput. Sci., pages 40-51. Springer, 1993.
29. G. L. Nemhauser and L. E. Trotter, Jr. Properties of vertex packing and independence system polyhedra. Math. Programming, 6:48-61, 1974.
30. R. Niedermeier. Invitation to fixed-parameter algorithms, Volume 31 of Oxford Lecture Series In Mathematics and its Applications. Oxford University Press, Oxford, 2006.
31. G. Philip, V. Raman, and Y. Villanger. A quartic kernel for pathwidth-one vertex deletion. In WG, Volume 6410 of Lecture Notes In Computer Science, pages 196-207, 2010.
32. N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B, 63:65-110, 1995.
33. N. Robertson, P. D. Seymour, and R. Thomas. Quickly excluding a planar graph. J. Comb. Theory Ser. B, 62:323-348, 1994.
34. S. Thomassé. A quadratic kernel for feedback vertex set. ACM Transactions on Algorithms, 6(2), 2010.