Journal of the ACM (JACM)
Improved results for directed multicut
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Improved Approximation Algorithms for Minimum Weight Vertex Separators
SIAM Journal on Computing
Parameterized approximation of dominating set problems
Information Processing Letters
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
Constant ratio fixed-parameter approximation of the edge multicut problem
Information Processing Letters
Resolution Is Not Automatizable Unless W[P] Is Tractable
SIAM Journal on Computing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fixed-parameter tractability of multicut parameterized by the size of the cutset
Proceedings of the forty-third annual ACM symposium on Theory of computing
On parameterized approximability
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized approximation problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized approximability of the disjoint cycle problem
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Parameterized Complexity
Parameterized Complexity and Approximation Algorithms
The Computer Journal
When is weighted satisfiability FPT?
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We prove that weighted circuit satisfiability for monotone or antimonotone circuits has no fixed-parameter tractable approximation algorithm with any approximation ratio function @r, unless FPTW[1]. In particular, not having such an fpt-approximation algorithm implies that these problems have no polynomial-time approximation algorithms with ratio @r(OPT) for any nontrivial function @r.