Kernelization: New upper and lower bound techniques

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

Volumn 5917 LNCS, Issue , 2009, Pages 17-37

  Bodlaender, Hans L ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Algorithms; Combinatorial problems; Data reduction; Fixed parameter tractability; Kernel; Kernelization; Preprocessing

Indexed keywords

COMBINATORIAL PROBLEM; COMBINATORIAL PROBLEMS; FIXED-PARAMETER TRACTABILITY; KERNEL; KERNELIZATION;

ALGORITHMS; CONTROL THEORY; DATA REDUCTION; GRAPH THEORY; POLYNOMIAL APPROXIMATION; STATISTICS; SURVEYS;

COMBINATORIAL MATHEMATICS;

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

References (78)

1. Abrahamson, K.A., Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues. Annals of Pure and Applied Logic 73, 235-276 (1995)
2. Abrahamson, K.R., Fellows, M.R.: Finite automata, bounded treewidth and well-quasiordering. In: Robertson, N., Seymour, P. (eds.) Proceedings of the AMS Summer Workshop on Graph Minors, Graph Structure Theory. Contemporary Mathematics, vol. 147, pp. 539-564. American Mathematical Society (1993)
3. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: Theory and experiments. In: Proceedings of the 6th Workshop on Algorithm Engineering and Experimentation and the 1st Workshop on Analytic Algorithmics and Combinatorics, ALENEX/ANALCO 2004, pp. 62-69. ACM-SIAM (2004)
4. Abu-Khzam, F.N., Fellows, M.R., Langston, M.A., Suters, W.H.: Crown structures for vertex cover kernelization. Theory of Computing Systems 41, 411-430 (2007)
5. Alber, J., Betzler, N., Niedermeier, R.: Experiments in data reduction for optimal domination in networks. Annals of Operations Research 146, 105-117 (2006)
6. Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating sets. J. ACM 51, 363-384 (2004)
7. Appel, K., Haken, W.: Every planar map is 4-colorable. Illinois J. Math. 21, 429-567 (1977)
8. Arnborg, S., Courcelle, B., Proskurowski, A., Seese, D.: An algebraic theory of graph reduction. J. ACM 40, 1134-1164 (1993)
9. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 153-180 (1994)
10. Bessy, S., Fomin, F.V., Gaspers, S., Paul, C., Perez, A., Saurabh, S., Thomassé, S.: Kernels for feedback arc set in tournaments. The Computing Research Repository, abs/0907.2165. To appear in proceedings FSTTCS 2009 (2009)
11. Betzler, N., Fellows, M.R., Guo, J., Niedermeier, R., Rosamond, F.A.: Fixedparameter algorithms for Kemeny rankings. Theor. Comp. Sc. 410, 4554-4570 (2009)
12. Bienstock, D., Langston, M.A.: Algorithmic implications of the graph minor theorem. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Handbook of Operations Research and Management Science: Network Models, pp. 481-502. North-Holland, Amsterdam (1995)
13. Böcker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: Evaluation and experiments. To appear in Algorithmica (2009) doi 10.1007/s00453-009-9339-7
14. Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comp. Sc. 209, 1-45 (1998)
15. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels (Extended abstract). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A.,Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 563-574. Springer, Heidelberg (2008)
16. Bodlaender, H.L., Fellows, M.R., Langston, M., Ragan, M., Rosamond, F., Weyer, M.: Quadratic kernelization for convex recoloring of trees. In: Lin, G. (ed.) COCOON 2007. LNCS, vol. 4598, pp. 86-96. Springer, Heidelberg (2007)
17. Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M. (Meta) kernelization. To appear in Proceedings FOCS 2009 (2009)
18. Bodlaender, H.L., Lokshtanov, D., Penninkx, E.: Planar capacitated dominating set is W[1]-hard. In: Proceedings IWPEC 2009 (2009)
19. Bodlaender, H.L., Penninkx, E.: A linear kernel for planar feedback vertex set. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 160-171. Springer, Heidelberg (2008)
20. Bodlaender, H.L., Penninkx, E., Tan, R.B.: A linear kernel for the k-disjoint cycle problem on planar graphs. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 294-305. Springer, Heidelberg (2008)
21. Bodlaender, H.L., Thomassé, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 635-646. Springer, Heidelberg (2009)
22. Bodlaender, H.L., van Antwerpen-de Fluiter, B.: Reduction algorithms for graphs of small treewidth. Information and Computation 167, 86-119 (2001)
23. Bodlaender, H.L., van Dijk, T.C.: A cubic kernel for feedback vertex set and loop cutset. To appear in Theory of Computing Systems (2009) doi: 10.1007/s00224-009-9234-2
24. Borie, R.B., Parker, R.G., Tovey, C.A.: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica 7, 555-581 (1992)
25. Bousquet, N., Daligault, J., Thomassé, S., Yeo, A.: A polynomial kernel for multicut in trees. In: Albers, S., Marion, J.-Y. (eds.) Proceedings 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, Schloss Dagstuhl, Germany. Dagstuhl Seminar Proceedings, vol. 09001, pp. 183-194. Leibniz-Zentrum für Informatik (2009)
26. Buss, J.F., Goldsmith, J.: Nondeterminism within P. SIAM J. Comput. 22, 560-572 (1993)
27. Cai, L., Chen, J.: On fixed-parameter tractability and approximability of NP optimization problems. Journal of Computer and System Sciences 54, 465-474 (1997)
28. Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: Advice classes of parameterized tractability. Annals of Pure and Applied Logic 84, 119-138 (1997)
29. Cai, L., Juedes, D.: On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences 67, 789-807 (2003)
30. Chen, J., Chor, B., Fellows, M., Huang, X., Juedes, D.W., Kanj, I.A., Xia, G.: Tight lower bounds for certain parameterized NP-hard problems. Information and Computation 201, 216-231 (2005)
31. Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. SIAM J. Comput. 37, 1077-1106 (2007)
32. Chen, J., Huang, X., Kanj, I.A., Xia, G.: On the computational hardness based on linear FPT-reductions. Journal of Combinatorial Optimization 11, 231-247 (2006)
33. Chen, J., Huang, X., Kanj, I.A., Xia, G.: Strong computational lower bounds via parameterized complexity. Journal of Computer and System Sciences 72, 1346-1367 (2006)
34. Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Bansal, N., Pruhs, K., Stein, C. (eds.) Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 298-307 (2007)
35. Courcelle, B.: The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85, 12-75 (1990)
36. Daligault, J., Thomassé, S.: On finding directed trees with many leaves. In: Proceedings IWPEC 2009 (2009)
37. de Fluiter, B.: Algorithms for Graphs of Small Treewidth. PhD thesis, Utrecht University (1997)
38. Dehne, F., Fellows, M., Fernau, H., Prieto, E., Rosamond, F.: Nonblocker: Parameterized algorithms for minimum dominating set. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 237-245. Springer, Heidelberg (2006)
39. Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In: To appear in: Electronic Colloquium on Computational Complexity (ECCC), vol. 16 (2009)
40. Demaine, E.D., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. The Computer Journal 51, 292-302 (2008)
41. Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S.E., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 378-389. Springer, Heidelberg (2009)
42. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput. 24, 873-921 (1995)
43. Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: On completeness for W[1]. Theor. Comp. Sc. 141, 109-131 (1995)
44. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
45. Downey, R.G., Fellows, M.R., Stege, U.: Parameterized complexity: A framework for systematically confronting computational intractability. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 49-99. American Mathematical Society (1997)
46. Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: Fpt is P-time extremal structure I. In: Broersma, H., Johnson, M., Szeider, S. (eds.) Proceedings of the 1st Workshop on Algorithms and Complexity in Durham, ACiD 2005. Text in Algorithms, vol. 4, pp. 1-41. King's College, London (2005)
47. Fellows, M.R.: Personal communication
48. Fellows, M.R., Langston, M.A.: An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, FOCS 1989, pp. 520-525 (1989)
49. Fernau, H.: Edge dominating set: Efficient enumeration-based exact algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 140-151. Springer, Heidelberg (2006)
50. Fernau, H., Fomin, F.V., Lokshtanov, D., Raible, D., Saurabh, S., Villanger, Y.: Kernel(s) for problems with no kernel: On out-trees with many leaves (extended abstract). In: Albers, S., Marion, J.-Y. (eds.) Proceedings 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, Schloss Dagstuhl, Germany. Dagstuhl Seminar Proceedings, vol. 09001, pp. 421-432. Leibniz-Zentrum für Informatik (2009)
51. Fernau, H., Juedes, D.W.: A geometric approach to parameterized algorithms for domination problems on planar graphs. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 488-499. Springer, Heidelberg (2004)
52. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
53. Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Algorithmic lower bounds for problems parameterized by clique-width. To appear in Proceedings SODA 2010 (2009)
54. Fomin, F.V., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Bidimensionality and kernels. To appear in Proceedings SODA 2010 (2009)
55. Fomin, F.V., Thilikos, D.M.: Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speedup. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 581-592. Springer, Heidelberg (2004)
56. Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. In: Proceedings of the 40th Annual Symposium on Theory of Computing, STOC 2008, pp. 133-142. ACM Press, New York (2008)
57. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithms13(2.2) (2008)
58. Guo, J.: A more effective linear kernelization for cluster editing. Theor. Comp. Sc. 410, 718-726 (2009)
59. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News 38, 31-45 (2007)
60. 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)
61. Guo, J., Niedermeier, R., Wernicke, S.: Fixed-parameter tractability results for full-degree spanning tree and its dual. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 203-214. Springer, Heidelberg (2006)
62. Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of vertex cover variants. Theory of Computing Systems 41, 501-520 (2007)
63. Gutin, G., Razgon, I., Kim, E.J.: Minimum leaf out-branching and related problems. Theor. Comp. Sc. 410, 4571-4579 (2009)
64. Gutner, S.: Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 246-257. Springer, Heidelberg (2009)
65. Jansen, B.: Fixed parameter complexity of the weighted max leaf problem. Master's thesis, Department of Computer Science, Utrecht University (2009)
66. Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: On the parameterized complexity of exact satisfiability problems. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 568-579. Springer, Heidelberg (2005)
67. 1 and MAX NP. In: Albers, S., Marion, J.-Y. (eds.) Proceedings 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, Schloss Dagstuhl, Germany. Dagstuhl Seminar Proceedings, vol. 09001, pp. 601-612. Leibniz-Zentrum für Informatik (2009)
68. Kratsch, S., Wahlström, M.: Two edge modification problems without polynomial kernels. In: Proceedings IWPEC 2009 (2009)
69. Lokshtanov, D., Mnich, M., Saurabh, S.: Linear kernel for planar connected dominating set. In: Chen, J., Cooper, S.B. (eds.) TAMC 2009. LNCS, vol. 5532, pp. 281-290. Springer, Heidelberg (2009)
70. Moser, H.: A problem kernelization for graph packing. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 401-412. Springer, Heidelberg (2009)
71. Moser, H., Sikdar, S.: The parameterized complexity of the induced matching problem. Disc. Appl. Math. 157, 715-727 (2009)
72. Nemhauser, G.L., Trotter, L.E.: Vertex packing: Structural properties and algorithms. Mathematical Programming 8, 232-248 (1975)
73. Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)
74. Philip, G., Raman, V., Sikdar, S.: Solving dominating set in larger classes of graphs: FPT algorithms and polynomial kernels. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 694-705. Springer, Heidelberg (2009)
75. Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Comb. Theory Series B 36, 49-64 (1984)
76. Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Series B 63, 65-110 (1995)
77. Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner's conjecture. J. Comb. Theory Series B 92, 325-357 (2004)
78. Thomassé, S.: A quadratic kernel for feedback vertex set. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, pp. 115-119 (2009)