[BOOK][B] Fundamentals of parameterized complexity
RG Downey, MR Fellows - 2013 - Springer
Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …
algorithm design and analysis, with a broad range of theoretical and practical aspects that …
Improved upper bounds for vertex cover
This paper presents an O (1.2738 k+ kn)-time polynomial-space algorithm for Vertex Cover
improving the previous O (1.286 k+ kn)-time polynomial-space upper bound by Chen, Kanj …
improving the previous O (1.286 k+ kn)-time polynomial-space upper bound by Chen, Kanj …
[BOOK][B] Algorithms and theory of computation handbook, volume 2: special topics and techniques
MJ Atallah, M Blanton - 2009 - books.google.com
This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …
topics, techniques, and applications. Along with updating and revising many of the existing …
Strong computational lower bounds via parameterized complexity
We develop new techniques for deriving strong computational lower bounds for a class of
well-known NP-hard problems. This class includes weighted satisfiability, dominating set …
well-known NP-hard problems. This class includes weighted satisfiability, dominating set …
Tight lower bounds for certain parameterized NP-hard problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds
on the computational complexity for a number of well-known NP-hard problems. We start by …
on the computational complexity for a number of well-known NP-hard problems. We start by …
Improved parameterized upper bounds for vertex cover
This paper presents an O (1.2738 k+ kn)-time polynomial-space parameterized algorithm for
Vertex Cover improving the previous O (1.286 k+ kn)-time polynomial-space upper bound by …
Vertex Cover improving the previous O (1.286 k+ kn)-time polynomial-space upper bound by …
Kernelization algorithms for the vertex cover problem
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments∗ Page 1
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments∗ Faisal N …
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments∗ Faisal N …
Parameterized complexity of vertex cover variants
J Guo, R Niedermeier, S Wernicke - Theory of Computing Systems, 2007 - Springer
Important variants of theVERTEX COVER problem (among others, CONNECTED VERTEX
COVER, CAPACITATED VERTEX COVER, and MAXIMUM PARTIAL VERTEX COVER) …
COVER, CAPACITATED VERTEX COVER, and MAXIMUM PARTIAL VERTEX COVER) …
Linear FPT reductions and computational lower bounds
We develop new techniques for deriving very strong computational lower bounds for a class
of well-known NP-hard problems, including weighted satisfiability, dominating set, hitting set …
of well-known NP-hard problems, including weighted satisfiability, dominating set, hitting set …
A stochastic local search approach to vertex cover
We introduce a novel stochastic local search algorithm for the vertex cover problem.
Compared to current exhaustive search techniques, our algorithm achieves excellent …
Compared to current exhaustive search techniques, our algorithm achieves excellent …