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 ρ.

• Type: Conference
• Year: 2010
• Where: COCO
• Authors: Dániel Marx
• Keywords: Algorithms, Approximation Algorithms, Approximation Ratio Function, COCO 2010, Tractable Approximation Algorithm