- Title
- On problems without polynomial kernels
- Creator
- Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny
- Relation
- 35th International Colloquium on Automata, Languages and Programming (ICALP 2008). Automata, Languages and Programming (Reykjavik, Iceland 7-11 July, 2008) p. 563-574
- Publisher Link
- http://dx.doi.org/10.1007/978-3-540-70575-8_46
- Publisher
- Springer Berlin
- Resource Type
- conference paper
- Date
- 2008
- Description
- Kernelization is a central technique used in parameterized algorithms, and in other approaches 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 k-Path, 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 problems parameterized by treewidth or cliquewidth.
- Subject
- kernelization; polynomial kernels; parameterized algorithms; optimization problems
- Identifier
- uon:5974
- Identifier
- http://hdl.handle.net/1959.13/45030
- Identifier
- ISBN:9783540705741
- Reviewed
- Hits: 3253
- Visitors: 2166
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|