A general method to speed up fixed-parameter-tractable algorithms
From MaRDI portal
Publication:1607033
DOI10.1016/S0020-0190(00)00004-1zbMath1014.68064MaRDI QIDQ1607033
Rolf Niedermeier, Peter Rossmanith
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs, Going Weighted: Parameterized Algorithms for Cluster Editing, Improved upper bounds for vertex cover, Refined memorization for vertex cover, An efficient fixed-parameter algorithm for 3-hitting set, Fixed parameter algorithms for one-sided crossing minimization revisited, Two fixed-parameter algorithms for vertex covering by paths on trees, Fixed-parameter algorithms for cluster vertex deletion, Efficiency in exponential time for domination-type problems, Fixed-parameter algorithms for Kemeny rankings, Going weighted: parameterized algorithms for cluster editing, Call control with \(k\) rejections, On the existence of subexponential parameterized algorithms, Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms, Improved exact algorithms for MAX-SAT, New fixed-parameter algorithms for the minimum quartet inconsistency problem, Applying modular decomposition to parameterized cluster editing problems, A refined search tree technique for dominating set on planar graphs, Parameterized computation and complexity: a new approach dealing with NP-hardness, On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems, New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
Cites Work
