Parameterized Inapproximability of Exact Cover and Nearest Codeword

by   Venkatesan Guruswami, et al.

The k-ExactCover problem is a parameterized version of the ExactCover problem, in which we are given a universe U, a collection S of subsets of U, and an integer k, and the task is to determine whether U can be partitioned into k sets in S. This is a natural extension of the well-studied SetCover problem; though in the parameterized regime we know it to be W[1]-complete in the exact case, its parameterized complexity with respect to approximability is not well understood. We prove that, assuming ETH, for some γ > 0 there is no time f(k) · N^γ k algorithm that can, given a k-ExactCover instance I, distinguish between the case where I has an exact cover of size k and the case where every set cover of I has size at least 1/4√( N/ N). This rules out even more than FPT algorithms, and additionally rules out any algorithm whose approximation ratio depends only on the parameter k. By assuming SETH, we instead improve the lower bound to requiring time f(k) · N^k - ε, for any ε > 0. In this work we also extend the inapproximability result to the k-Nearest-Codeword (k-NCP) problem. Specifically, given a generator matrix A ∈F_2^m × n, a vector y ∈F_2^m, and the parameter k, we show that it is hard to distinguish between the case where there exists a codeword with distance at most k from y and the case where every codeword has distance at least 1/8√( N/ N) from y. This improves the best known parameterized inapproximability result, which rules out approximations with a factor of poly ( k), but requires us to assume ETH instead of W[1] ≠ FPT.



There are no comments yet.


page 1

page 2

page 3

page 4


Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH

The k-Even Set problem is a parameterized variant of the Minimum Distanc...

A Simple Gap-producing Reduction for the Parameterized Set Cover Problem

Given an n-vertex bipartite graph I=(S,U,E), the goal of set cover probl...

On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes

In the (k,h)-SetCover problem, we are given a collection 𝒮 of sets over ...

Perfectly Matched Sets in Graphs: Hardness, Kernelization Lower Bound, and FPT and Exact Algorithms

In an undirected graph G=(V,E), we say (A,B) is a pair of perfectly matc...

Exact Crossing Number Parameterized by Vertex Cover

We prove that the exact crossing number of a graph can be efficiently co...

Parameterized Intractability of Even Set and Shortest Vector Problem

The k-Even Set problem is a parameterized variant of the Minimum Distanc...

From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization

We generalize the tree doubling and Christofides algorithm, the two most...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.