Sciweavers

Share
COCO
2010
Springer

Completely Inapproximable Monotone and Antimonotone Parameterized Problems

8 years 11 months ago
Completely Inapproximable Monotone and Antimonotone Parameterized Problems
We prove that weighted monotone/antimonotone circuit satisfiability has no fixed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT = W[1]. In particular, not having such an fptapproximation algorithm implies that these problems have no polynomial-time approximation algorithms with ratio ρ(OPT) for any nontrivial function ρ.
Dániel Marx
Added 15 Aug 2010
Updated 15 Aug 2010
Type Conference
Year 2010
Where COCO
Authors Dániel Marx
Comments (0)
books