On problems without polynomial kernels (extended abstract)

Hans L. Bodlaender; Rodney G. Downey; Michael R. Fellows; Danny Hermelin

doi:10.1007/978-3-540-70575-8_46

On problems without polynomial kernels (extended abstract)

Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

53 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings
Pages	563-574
Number of pages	12
Edition	PART 1
DOIs	https://doi.org/10.1007/978-3-540-70575-8_46
State	Published - 14 Aug 2008
Externally published	Yes
Event	35th International Colloquium on Automata, Languages and Programming, ICALP 2008 - Reykjavik, Iceland Duration: 7 Jul 2008 → 11 Jul 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	5125 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	35th International Colloquium on Automata, Languages and Programming, ICALP 2008
Country/Territory	Iceland
City	Reykjavik
Period	7/07/08 → 11/07/08

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-70575-8_46

Cite this

Bodlaender, H. L., Downey, R. G., Fellows, M. R., & Hermelin, D. (2008). On problems without polynomial kernels (extended abstract). In Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings (PART 1 ed., pp. 563-574). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5125 LNCS, No. PART 1). https://doi.org/10.1007/978-3-540-70575-8_46

Bodlaender, Hans L. ; Downey, Rodney G. ; Fellows, Michael R. et al. / On problems without polynomial kernels (extended abstract). Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings. PART 1. ed. 2008. pp. 563-574 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).

@inproceedings{e27f1ff82a8d46198bb99150c4b2adec,

title = "On problems without polynomial kernels (extended abstract)",

abstract = "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.",

author = "Bodlaender, {Hans L.} and Downey, {Rodney G.} and Fellows, {Michael R.} and Danny Hermelin",

year = "2008",

month = aug,

day = "14",

doi = "10.1007/978-3-540-70575-8_46",

language = "English",

isbn = "3540705740",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 1",

pages = "563--574",

booktitle = "Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings",

edition = "PART 1",

note = "35th International Colloquium on Automata, Languages and Programming, ICALP 2008 ; Conference date: 07-07-2008 Through 11-07-2008",

}

Bodlaender, HL, Downey, RG, Fellows, MR & Hermelin, D 2008, On problems without polynomial kernels (extended abstract). in Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 5125 LNCS, pp. 563-574, 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, Reykjavik, Iceland, 7/07/08. https://doi.org/10.1007/978-3-540-70575-8_46

On problems without polynomial kernels (extended abstract). / Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R. et al.
Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings. PART 1. ed. 2008. p. 563-574 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5125 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On problems without polynomial kernels (extended abstract)

AU - Bodlaender, Hans L.

AU - Downey, Rodney G.

AU - Fellows, Michael R.

AU - Hermelin, Danny

PY - 2008/8/14

Y1 - 2008/8/14

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=49049107158&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-70575-8_46

DO - 10.1007/978-3-540-70575-8_46

M3 - Conference contribution

AN - SCOPUS:49049107158

SN - 3540705740

SN - 9783540705741

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

SP - 563

EP - 574

BT - Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings

T2 - 35th International Colloquium on Automata, Languages and Programming, ICALP 2008

Y2 - 7 July 2008 through 11 July 2008

ER -

Bodlaender HL, Downey RG, Fellows MR, Hermelin D. On problems without polynomial kernels (extended abstract). In Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings. PART 1 ed. 2008. p. 563-574. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-540-70575-8_46

On problems without polynomial kernels (extended abstract)

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this