On Problems without Polynomial Kernels (Extended Abstract)

@inproceedings{Bodlaender2008OnPW,
  title={On Problems without Polynomial Kernels (Extended Abstract)},
  author={Hans L. Bodlaender and Rodney G. Downey and Michael R. Fellows and Danny Hermelin},
  booktitle={ICALP},
  year={2008}
}
Kernelization is a central technique used in parameterized algorithms, and in other techniques for coping with NP-hard problems. In this paper, we introduce a new method which allows us to show that many problems do not have polynomial size kernels under reasonable complexity-theoretic assumptions. These problems include kPath, k-Cycle, k-Exact Cycle, k-Short Cheap Tour, k-Graph Minor Order Test, k-Cutwidth, k-Search Number, k-Pathwidth, k-Treewidth, k-Branchwidth, and several optimization… CONTINUE READING
35 Citations
30 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Bodlaender . A cubic kernel for feedback vertex set

  • L Hans
  • Proceedings of the 24 th annual Symposium on…
  • 2007

Divide-and-color

  • J. Kneis, D. Mölle, S. Richter, P. Rossmanith
  • In Proceedings of the international Workshop on…
  • 2006
1 Excerpt

Similar Papers

Loading similar papers…