Baby pih: Parameterized inapproximability of min csp
V Guruswami, X Ren, S Sandeep - arXiv preprint arXiv:2310.16344, 2023 - arxiv.org
The Parameterized Inapproximability Hypothesis (PIH) is the analog of the PCP theorem in
the world of parameterized complexity. It asserts that no FPT algorithm can distinguish a …
the world of parameterized complexity. It asserts that no FPT algorithm can distinguish a …
[PDF][PDF] Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis
The Parameterized Inapproximability Hypothesis (PIH) asserts that no fixed parameter
tractable (FPT) algorithm can distinguish a satisfiable CSP instance, parameterized by the …
tractable (FPT) algorithm can distinguish a satisfiable CSP instance, parameterized by the …
Parameterized Inapproximability Hypothesis under ETH
The Parameterized Inapproximability Hypothesis (PIH) asserts that no fixed parameter
tractable (FPT) algorithm can distinguish a satisfiable CSP instance, parameterized by the …
tractable (FPT) algorithm can distinguish a satisfiable CSP instance, parameterized by the …
Fine Grained Lower Bounds for Multidimensional Knapsack
We study the $ d $-dimensional knapsack problem. We are given a set of items, each with a
$ d $-dimensional cost vector and a profit, along with a $ d $-dimensional budget vector. The …
$ d $-dimensional cost vector and a profit, along with a $ d $-dimensional budget vector. The …
On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
Abstract Parameterized Inapproximability Hypothesis (PIH) is a central question in the field
of parameterized complexity. PIH asserts that given as input a 2-CSP on k variables and …
of parameterized complexity. PIH asserts that given as input a 2-CSP on k variables and …
On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
E Lee, P Manurangsi - arXiv preprint arXiv:2407.08917, 2024 - arxiv.org
Parameterized Inapproximability Hypothesis (PIH) is a central question in the field of
parameterized complexity. PIH asserts that given as input a 2-CSP on $ k $ variables and …
parameterized complexity. PIH asserts that given as input a 2-CSP on $ k $ variables and …
Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
In this paper we introduce Sampling with a Black Box, a generic technique for the design of
parameterized approximation algorithms for vertex deletion problems (eg, Vertex Cover …
parameterized approximation algorithms for vertex deletion problems (eg, Vertex Cover …