Weak compositions and their applications to polynomial lower bounds for kernelization

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 104-113

  Hermelin, Danny ^a   Wu, Xi ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR TRANSFORMATIONS; MATHEMATICAL TRANSFORMATIONS; POLYNOMIAL APPROXIMATION;

CRYPTOGRAPHIC APPLICATIONS; LINEAR PARAMETERS; PARAMETERIZED PROBLEMS; POLYNOMIAL KERNELS; QUASI-POLY-NOMIAL; QUASI-POLYNOMIAL TIME; SUPER-POLYNOMIALS; WEAK COMPOSITIONS;

PARAMETERIZATION;

EID: 84860172570     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.9     Document Type: Conference Paper

References (27)

1. Jochen Alber, Michael R. Fellows, and Rolf Niedermeier. Polynomial-time data reduction for dominating set. Journal of the ACM, 51(3):363-384, 2004.
2. Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Szeider, and Anders Yeo. Solving MAX-r-SAT above a tight lower bound. In Proc. of the 21st annual ACM-SIAM Symposium On Discrete Algorithms (SODA), pages 511-517, 2010.
3. Hans L. Bodlaender. Kernelization: New upper and lower bound techniques. In Proc. of the 4th International Workshop on Parameterized and Exact Computation (IWPEC), pages 17-37, 2009.
4. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, and Danny Hermelin. On problems without polynomial kernels. Journal of Computer and System Sciences, 75(8):423-434, 2009.
5. Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, and Dimitrios M. Thilikos. (Meta) kernelization. In Proc. of the 50th annual IEEE symposium on Foundations Of Computer Science (FOCS), pages 629-638, 2009.
6. Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. Cross-composition: A new technique for kernelization lower bounds. In Proc. of the 28th international Symposium on Theoretical Aspects of Computer Science (STACS), pages 165-176, 2011.
7. Hans L. Bodlaender, Stephan Thomassé, and Anders Yeo. Kernel bounds for disjoint cycles and disjoint paths. In Proc. of the 17th annual European Symposium on Algorithms (ESA), pages 635-646, 2009.
8. Liming Cai, Jianer Chen, Rodney G. Downey, and Michael R. Fellows. Advice classes of paramterized tractability. Annals of Pure and Applied Logic, 84(1):119-138, 1997.
9. Yijia Chen, Jörg Flum, and Moritz Müller. Lower bounds for kernelizations and other preprocessing procedures. Theory of Computing Systems, 48(4):803-839, 2011.
10. Holger Dell and Dieter van Melkebeek. Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In Proc. of the 42th annual ACM Symposium on Theory Of Computing (STOC), pages 251-260, 2010.
11. Michael Dom, Daniel Lokshtanov, and Saket Saurabh. Incompressibility through colors and IDs. In Proc. of the 36th International Colloquium on Automata, Languages and Programming (ICALP), pages 378-389, 2009.
12. Rodney G. Downey and Michael R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
13. Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, and Sue Whitesides. Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica, 52(2):167-176, 2008.
14. Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, and Yngve Villanger. Kernel(s) for problems with no kernel: On out-trees with many leaves. In Proc. of the 26th international Symposium on Theoretical Aspects of Computer Science (STACS), pages 421-432, 2009.
15. Holger Dell and Dániel Marx. Kernelization of Packing Problems. In Proc. of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2012.
16. Lance Fortnow and Raul Santhanam. Infeasibility of instance compression and succinct PCPs for NP. In Proc. of the 40th annual ACM Symposium on Theory Of Computing (STOC), pages 133-142, 2008.
17. Michael R. Garey and David S. Johnson. Computers and intractability : A guide to the theory of NP-completeness. W.H. Freeman, 1979.
18. Sylvain Guillemot, Christophe Paul, and Anthony Perez. On the (non-)existence of polynomial kernels for P(-free edge modification problems. In Proc. of the 5th International symposium on Parameterized and Exact Computation (IPEC), pages 147-157, 2010.
19. Jiong Guo and Rolf Niedermeier. Invitation to data reduction and problem kernelization. SIGACT News, 38(1):31-45, 2007.
20. Danny Harnik and Moni Naor. On the compressibility of NP instances and cryptographic applications. SIAM Journal on Computing, 39(5):1667-1713, 2010.
21. Danny Hermelin and Xi Wu. Weak Compositions and Their Applications to Polynomial Lower-Bounds for Kernelization. Electronic Colloquium on Computational Complexity (ECCC), 18:72, 2011.
22. Stefan Kratsch, Dániel Marx, and Magnus Wahlström. Parameterized complexity and kernelizability of max ones and exact ones problems. In Proc. of the 35th international symposium on Mathematical Foundations of Computer Science (MFCS), pages 489-500, 2010.
23. Stefan Kratsch and Magnus Wahlström. Two edge modification problems without polynomial kernels. In Proc. of the 4th International Workshop on Parameterized and Exact Computation (IWPEC), pages 264-275, 2009.
24. Stefan Kratsch and Magnus Wahlström. Preprocessing of min ones problems: A dichotomy. In Proc. of the 37th International Colloquium on Automata, Languages and Programming (ICALP), pages 653-665, 2010.
25. George L. Nemhauser and Leslie E. Trotter Jr. Vertex packings: Structural properties and algorithms. Mathematical Programming, 8(2):232-248, 1975.
26. Aduri Pavan, Alan L. Selman, Samik Sengupta, and Vinodchandran N. Variyam. Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy. Theoretical Computer Science, 385(3):391-404, 2007.
27. 2 kernel for feedback vertex set. ACM Transactions on Algorithms, 6(2), 2010.