Co-nondeterminism in compositions: A kernelization lower bound for a Ramsey-type problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 114-122

  Kratsch, Stefan ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

BOUNDED PARAMETERS; COMPOSITION RULE; MAXIMUM INDEPENDENT SETS; NON-DETERMINISM; PARAMETERIZED COMPLEXITY; POLYNOMIAL HIERARCHIES; POLYNOMIAL KERNELS; POLYNOMIAL SIZE;

GRAPH THEORY;

EID: 84860212607     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.10     Document Type: Conference Paper

References (22)

1. B. Barak, A. Rao, R. Shaltiel, and A. Wigderson. 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. In J. M. Kleinberg, editor, STOC, pages 671-680. ACM, 2006. (Pubitemid 44306601)
2. 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.
3. H. L. Bodlaender, F. V. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh, and D. M. Thilikos. (meta) kernelization. In FOCS, pages 629-638. IEEE Computer Society, 2009.
4. H. L. Bodlaender, B. M. P. Jansen, and S. Kratsch. Cross-composition: A new technique for kernelization lower bounds. In T. Schwentick and C. Dürr, editors, STACS, volume 9 of LIPIcs, pages 165-176. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011.
5. H. L. Bodlaender, S. Thomassé, and A. Yeo. Kernel bounds for disjoint cycles and disjoint paths. In A. Fiat and P. Sanders, editors, ESA, volume 5757 of Lecture Notes in Computer Science, pages 635-646. Springer, 2009.
6. D. Conlon. A new upper bound for diagonal Ramsey numbers. Annals of Mathematics, to appear, 2009.
7. H. Dell and D. van Melkebeek. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In L. J. Schulman, editor, STOC, pages 251-260. ACM, 2010.
8. M. Dom, D. Lokshtanov, and S. Saurabh. Incompressibility through Colors and IDs. In S. Albers, A. Marchetti-Spaccamela, Y. Matias, S. E. Nikoletseas, and W. Thomas, editors, ICALP (1), volume 5555 of Lecture Notes in Computer Science, pages 378-389. Springer, 2009.
9. H. Fernau, F. V. Fomin, D. Lokshtanov, D. Raible, S. Saurabh, and Y. Villanger. Kernel(s) for problems with no kernel: On out-trees with many leaves. In S. Albers and J.-Y. Marion, editors, STACS, volume 3 of LIPIcs, pages 421-432. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2009.
10. F. V. Fomin, D. Lokshtanov, S. Saurabh, and D. M. Thilikos. Bidimensionality and kernels. In M. Charikar, editor, SODA, pages 503-510. SIAM, 2010.
11. L. Fortnow and R. Santhanam. Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci., 77(1):91-106, 2011.
12. J. Guo and R. Niedermeier. Invitation to data reduction and problem kernelization. SIGACT News, 38(1):31-45, 2007.
13. D. Harnik and M. Naor. On the compressibility of MV instances and cryptographic applications. SIAM J. Comput., 39(5):1667-1713, 2010.
14. D. Hermelin and X. Wu. Weak compositions and their applications to polynomial lower-bounds for kernelization. Electronic Colloquium on Computational Complexity (ECCC), 18:72, 2011.
15. S. Khot and V. Raman. Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput Sci., 289(2):997-1008, 2002. (Pubitemid 35167694)
16. S. Kratsch and M. Wahlström. Preprocessing of min ones problems: A dichotomy. In S. Abramsky, C. Gavoille, C. Kirchner, F. M. auf der Heide, and P. G. Spirakis, editors, ICALP (1), volume 6198 of Lecture Notes in Computer Science, pages 653-665. Springer, 2010.
17. C. Paul, A. Perez, and S. Thomassé. Conflict packing yields linear vertex-kernels for rooted triplet inconsistency and other problems. CoRR, abs/1101.4491, 2011.
18. F. P. Ramsey. On a problem of formal logic. Proceedings of the London Mathematical Society, s2-30(1):264-286, 1930.
19. J. H. Spencer. Ramsey's theorem - a new lower bound. Journal of Combinatorial Theory, Series A, 18(1):108-115, 1975.
20. 2 kernel for feedback vertex set. ACM Transactions on Algorithms, 6(2), 2010.
21. G. J. Woeginger. Exact algorithms for NP-hard problems: A survey. In M. Jünger, G. Reinelt, and G. Rinaldi, editors, Combinatorial Optimization, volume 2570 of Lecture Notes in Computer Science, pages 185-208. Springer, 2001.
22. C.-K. Yap. Some consequences of non-uniform conditions on uniform classes. Theor. Comput. Sci., 26:287-300, 1983.