On problems without polynomial kernels (extended abstract)

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

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 563-574

  Bodlaender, Hans L ^a   Downey, Rodney G ^b   Fellows, Michael R ^c   Hermelin, Danny ^d  

^a UTRECHT UNIVERSITY   (Netherlands)

^b VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^c UNIVERSITY OF NEWCASTLE   (Australia)

^d UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; TRANSLATION (LANGUAGES);

BRANCH WIDTH; CUTWIDTH; KERNELIZATION; NP-HARD PROBLEMS; OPTIMIZ ATION PROBLEMS; PARAMETERIZED; PARAMETERIZED ALGORITHMS; PATH WIDTH; POLYNOMIAL KERNELS; POLYNOMIAL SIZE; TREE-WIDTH;

LINGUISTICS;

EID: 49049107158     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_46     Document Type: Conference Paper

References (31)

1. Alber, J., Fellows, M.R., Niedermeier, R.: Efficient data reduction for DOMINATING SET: A linear problem kernel for the planar case. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 150-159. Springer, Heidelberg (2002)
2. Alon, N., Yuster, R., Zwick, U.: Color coding. Journal of the ACM 42(4), 844-856 (1995)
3. Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability. A survey. BIT Numerical Mathematics 25(1), 2-23 (1985)
4. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25, 1305-1317 (1996)
5. Bodlaender, H.L.: A cubic kernel for feedback vertex set. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 320-331. Springer, Heidelberg (2007)
6. Bonsma, P.S., Brüggemann, T., Woeginger, G.J.: A faster FPT algorithm for finding spanning trees with many leaves. In: Rovan, B., Vojtáŝ, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 259-268. Springer, Heidelberg (2003)
7. Buhrman, H.: Private communication (2007)
8. Burrage, K., Estivill-Castro, V., Fellows, M.R., Langston, M.A., Mac, S., Rosamond, F.A.: The undirected feedback vertex set problem has a Poly(k) kernel. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 192-202. Springer, Heidelberg (2006)
9. Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: Advice classes of paramterized tractability. Annals of Pure and Applied Logic 84(1), 119-138 (1997)
10. Cai, L., Juedes, D.W.: Subexponential parameterized algorithms collapse the Whierarchy. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 273-284. Springer, Heidelberg (2001)
11. Chen, Y., Flum, J., Müller, M.: Lower Bounds for Kernelizations - (manuscript, 2007)
12. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
13. Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. In: Proceedings of the 6th annual ACM/SIAM Symposium on Discrete Algorithms (SODA), pp. 632-640 (1995)
14. Fellows, M.R., Langston, M.A.: Nonconstructive proofs of polynomial-time complexity. Information Processing Letters 26, 157-162 (1988)
15. Fellows, M.R., Langston, M.A.: On well-partial-order theory and its application to combinatorial problems of VLSI design. SIAM Journal of Discrete Math. 5(1), 117-126 (1992)
16. Fernau, H.: Parameterized algorithms: A graph-theoretic approach. PhD thesis, University of Tübingen (2005)
17. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
18. 2n nondeterministic bits. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 555-567. Springer, Heidelberg (2004)
19. Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. In: Proceedings of the 40th Symposium on the Theory of Computing (STOC) (to appear, 2008)
20. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
21. Gramm, J., Guo, J., Huffner, F., Niedermeier, R.: Graph-modeled data clustering: Exact algorithms for clique generation. Mathematical Systems Theory 38, 373-392 (2005)
22. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31-45 (2007)
23. Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of generalized vertex cover problems. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 36-48. Springer, Heidelberg (2005)
24. Harnik, D., Naor, M.: On the compressibility of NP instances and cryptographic applications. In: Proceedings of 47th annual IEEE symposium on Foundations Of Computer Science (FOCS), pp. 719-728 (2006)
25. Kneis, J., Mölle, D., Richter, S., Rossmanith, P.: Divide-and-color. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 58-67. Springer, Heidelberg (2006)
26. Ko, K.: On self-reducibility and weak P-selectivity. Journal of Computer and System Sciences 26(2), 209-221 (1983)
27. Liu, Y., Lu, S., Chen, J., Sze, S.: Greedy localization and color-coding: Improved matching and packing algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 84-95. Springer, Heidelberg (2006)
28. Niedermeier, R., Rossmanith, P.: An efficient fixed-parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms 1, 89-102 (2003)
29. Plehn, J., Voigt, B.: Finding minimally weighted subgraphs. In: Möhring, R.H. (ed.) WG 1990. LNCS, vol. 484, pp. 18-29. Springer, Heidelberg (1991)
30. Robertson, N., Sanders, D.P., Seymour, P., Thomas, R.: Efficiently four-coloring planar graphs. In: Proceedings of the 28th annual ACM Symposium on the Theory Of Computing (STOC), pp. 571-575 (1996)
31. Stockmeyer, L.J.: The polynomial-time hierarchy. Theoretical Computer Science 3, 1-22 (1977)