Completely inapproximable monotone and antimonotone parameterized problems

We prove that weighted circuit satisfiability for monotone or antimonotone circuits has no fixed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT≠W[1]. In particular, not having such an fpt-approximation algorithm implies that these problems have no pol...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer and system sciences Jg. 79; H. 1; S. 144 - 151
1. Verfasser: Marx, Dániel
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 01.02.2013
Schlagworte:
Algorithms
Approximation
Circuit satisfiability
Circuits
Fixed-parameter tractability
Inapproximability
Mathematical analysis
Mathematical models
Circuit satisfiability
Circuits
Fixed-parameter tractability
Inapproximability
ISSN:0022-0000, 1090-2724
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We prove that weighted circuit satisfiability for monotone or antimonotone circuits has no fixed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT≠W[1]. In particular, not having such an fpt-approximation algorithm implies that these problems have no polynomial-time approximation algorithms with ratio ρ(OPT) for any nontrivial function ρ. ► We show fpt-inapproximability results for natural problems. ► Results are under the standard complexity assumption that FPT is different from W[1]. ► Weighted Monotone Circuit Satisfiability has no fpt-approximation for any ratio. ► Weighted Antimonotone Circuit Satisfiability has no fpt-approximation for any ratio.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2012.09.001