On polynomial kernels for structural parameterizations of odd cycle transversal

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

Volumn 7112 LNCS, Issue , 2012, Pages 132-144

  Jansen, Bart M P ^a   Kratsch, Stefan ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; BIPARTITENESS; FEEDBACK VERTEX SET; INDEPENDENT SET; LOWER BOUNDS; ODD CYCLE; OPEN PROBLEMS; OUTERPLANAR GRAPH; PARAMETERIZATIONS; PARAMETERIZED; PARAMETERIZED COMPLEXITY; POLYNOMIAL KERNELS; TREE-WIDTH; VERTEX COVER;

FORESTRY; GRAPH THEORY; POLYNOMIALS;

PARAMETERIZATION;

DISTANCE; FORESTRY; GRAPHIC METHODS; PARAMETERS; PROBLEM SOLVING;

EID: 84858396025     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28050-4_11     Document Type: Conference Paper

References (29)

1. Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.: O(sqrt(log n)) approximation algorithms for min uncut, min 2cnf deletion, and directed cut problems. In: Proc. 37th STOC, pp. 573-581 (2005)
2. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423-434 (2009)
3. Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) Kernelization. In: Proc. 50th FOCS, pp. 629-638 (2009)
4. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: A new technique for kernelization lower bounds. In: Proc. 28th STACS, pp. 165-176 (2011)
5. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 437-448. Springer, Heidelberg (2011)
6. Bousquet, N., Daligault, J., Thomassé, S.: Multicut is FPT. In: Proc. 43rd STOC, pp. 459-468 (2011)
7. Chen, J., Liu, Y., Lu, S., O'Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5) (2008)
8. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125-150 (2000)
9. Downey, R., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)
10. Fellows, M.R., Lokshtanov, D., Misra, N., Mnich, M., Rosamond, F.A., Saurabh, S.: The complexity ecology of parameters: An illustration using bounded max leaf number. Theory Comput. Syst. 45(4), 822-848 (2009)
11. Fiorini, S., Hardy, N., Reed, B.A., Vetta, A.: Planar graph bipartization in linear time. Discrete Applied Mathematics 156(7), 1175-1180 (2008)
12. Fomin, F.V., Lokshtanov, D., Misra, N., Philip, G., Saurabh, S.: Hitting forbidden minors: Approximation and kernelization. In: Proc. 28th STACS, pp. 189-200 (2011)
13. Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77(1), 91-106 (2011)
14. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R.,Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8), 1386-1396 (2006)
15. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31-45 (2007)
16. Hüffner, F.: Algorithm engineering for optimal graph bipartization. J. Graph Algorithms Appl. 13(2), 77-98 (2009)
17. Jansen, B.M.P., Bodlaender, H.L.: Vertex cover kernelization revisited: Upper and lower bounds for a refined parameter. In: Proc. 28th STACS, pp. 177-188 (2011)
18. Jansen, B.M.P., Kratsch, S.: On polynomial kernels for structural parameterizations of odd cycle transversal. CoRR, abs/1107.3658 (2011)
19. Kawarabayashi, K., Reed, B.A.: An (almost) linear time algorithm for odd cyles transversal. In: Proc. 21st SODA, pp. 365-378 (2010)
20. Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. 34th STOC, pp. 767-775 (2002)
21. Kratsch, S., Wahlström, M.: Compression via matroids: A randomized polynomial kernel for odd cycle transversal. CoRR, abs/1107.3068 (2011)
22. Marx, D.: Parameterized graph separation problems. Theoretical Computer Science 351(3), 394-406 (2006); Parameterized and Exact Computation
23. Marx, D., O'Sullivan, B., Razgon, I.: Treewidth reduction for constrained separation and bipartization problems. In: Proc. 27th STACS, pp. 561-572 (2010)
24. Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: Proc. 43rd STOC, pp. 469-478 (2011)
25. Raman, V., Saurabh, S., Sikdar, S.: Improved Exact Exponential Algorithms for Vertex Bipartization and other Problems. In: Coppo, M., Lodi, E., Pinna, G.M. (eds.) ICTCS 2005. LNCS, vol. 3701, pp. 375-389. Springer, Heidelberg (2005)
26. Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299-301 (2004)
27. Rizzi, R., Bafna, V., Istrail, S., Lancia, G.: Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 29-43. Springer, Heidelberg (2002)
28. Uhlmann, J., Weller, M.: Two-Layer Planarization Parameterized by Feedback Edge Set. In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol. 6108, pp. 431-442. Springer, Heidelberg (2010)
29. Wernicke, S.: On the algorithmic tractability of single nucleotide polymorphism (SNP) analysis and related problems. Master's thesis, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen (2003)