A general method to speed up fixed-parameter-tractable algorithms

A fixed-parameter-tractable algorithm, or FPT algorithm for short, gets an instance (I,k) as its input and has to decide whether (I,k)∈ L for some parameterized problem L . Many parameterized algorithms work in two stages: reduction to a problem kernel and bounded search tree. Their time complexity...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 73; číslo 3; s. 125 - 129
Hlavní autoři: Niedermeier, Rolf, Rossmanith, Peter
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 29.02.2000
Elsevier Science
Témata:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computer science; control theory; systems
Decision theory. Utility theory
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Parameterized complexity
Theoretical computing
Parameterized complexity
Algorithms
Parmetrized complexity
Reduction to problem kernel
Fixed parameter tractable algorithm
Search tree
Acceleration
Algorithm
Computational complexity
Time complexity
ISSN:0020-0190, 1872-6119
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A fixed-parameter-tractable algorithm, or FPT algorithm for short, gets an instance (I,k) as its input and has to decide whether (I,k)∈ L for some parameterized problem L . Many parameterized algorithms work in two stages: reduction to a problem kernel and bounded search tree. Their time complexity is then of the form O(p(|I|)+q(k)ξ k) , where q(k) is the size of the problem kernel. We show how to modify these algorithms to obtain time complexity O(p(|I|)+ξ k) , if q(k) is polynomial.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(00)00004-1