# Completely Inapproximable Monotone and Antimonotone Parameterized Problems

@inproceedings{Marx2010CompletelyIM,
title={Completely Inapproximable Monotone and Antimonotone Parameterized Problems},
author={D{\'a}niel Marx},
booktitle={IEEE Conference on Computational Complexity},
year={2010}
}
We prove that weighted circuit satisfiability for monotone or antimonotone circuits has no fixed-parameter tractable approximation algorithm with any approximation ratio function $\rho$, unless $FPT\neq W[1]$. In particular, not having such an fpt-approximation algorithm implies that these problems have no polynomial-time approximation algorithms with ratio $\rho(OPT)$ for any nontrivial function $\rho$.

#### Citations

##### Publications citing this paper.
Showing 1-10 of 17 extracted citations
Highly Influenced
8 Excerpts
Highly Influenced
4 Excerpts

#### References

##### Publications referenced by this paper.
Showing 1-4 of 4 references

#### Similar Papers

Loading similar papers…