Subexponential Parameterized Algorithms Collapse the W-Hierarchy

Authors:
Liming Cai;David W. Juedes
Affiliations:
-;-
Venue:
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Year:
2001

Citing 12
Cited 7

Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
The Complexity of Decision Versus Search

SIAM Journal on Computing
Fixed-parameter tractability and completeness II: on completeness for W[1]

Theoretical Computer Science
Hardness of approximations

Approximation algorithms for NP-hard problems
On fixed-parameter tractability and approximability of NP optimization problems

Journal of Computer and System Sciences - special issue on complexity theory
An improved fixed-parameter algorithm for vertex cover

Information Processing Letters
Parameterizing above guaranteed values: MaxSat and MaxCut

Journal of Algorithms
Faster exact algorithms for hard problems: a parameterized point of view

Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Which Problems Have Strongly Exponential Complexity?

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Upper bounds for vertex cover further improved

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Parameterized Complexity: The Main Ideas and Some Research Frontiers

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Graph Separators: A Parameterized View

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Parameterized algorithms

Algorithms and theory of computation handbook
A parameterized complexity tutorial

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
A basic parameterized complexity primer

The Multivariate Algorithmic Revolution and Beyond

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that for essentially all MAX SNP-hard optimization problems finding exact solutions in subexponential time is not possible unless W[1] = FPT. In particular, we show that O(2°(k)p(n)) parameterized algorithms do not exist for Vertex Cover, Max Cut, Max c-Sat, and a number of problems on bounded degree graphs such as Dominating Set and Independent Set, unless W[1] = FPT. Our results are derived via an approach that uses an extended parameterization of optimization problems and associated techniques to relate the parameterized complexity of problems in FPT to the parameterized complexity of extended versions that are W[1]-hard.