Completely inapproximable monotone and antimonotone parameterized problems

11/10/2017
by   Dániel Marx, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/03/2023

Polynomial-time Approximation of Independent Set Parameterized by Treewidth

We prove the following result about approximating the maximum independen...
research
08/29/2023

Approximate Monotone Local Search for Weighted Problems

In a recent work, Esmer et al. describe a simple method - Approximate Mo...
research
12/10/2021

Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem

Let P be a set of points in ℝ^d, where each point p∈ P has an associated...
research
03/15/2021

Promise Problems Meet Pseudodeterminism

The Acceptance Probability Estimation Problem (APEP) is to additively ap...
research
12/01/2017

Closed Formulas of the Arithmetic Mean Component Competitive Ratio for the 3-Objective and 4-Objective Time Series Search Problems

For the multi-objective time series search problem, Hasegawa and Itoh [P...
research
08/14/2017

From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More

We consider questions that arise from the intersection between the areas...
research
04/09/2018

Beating the integrality ratio for s-t-tours in graphs

Among various variants of the traveling salesman problem, the s-t-path g...

Please sign up or login with your details

Forgot password? Click here to reset