On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs

Abstract

Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex cover is polynomial time solvable. In this work, we study the natural extension of bipartite vertex cover to hypergraphs, namely finding a small vertex cover in k-uniform k-partite hypergraphs, when the k-partition is given as input. For this problem Lovász [16] gave a \(\frac{k}{2}\) factor LP rounding based approximation, and a matching \(\left(\frac{k}{2} - o(1)\right)\) integrality gap instance was constructed by Aharoni et al. [1]. We prove the following results, which are the first strong hardness results for this problem (here ε> 0 is an arbitrary constant): NP-hardness of approximating within a factor of \(\left(\frac{k}{4} - \varepsilon\right)\), and Unique Games-hardness of approximating within a factor of \(\left(\frac{k}{2} - \varepsilon\right)\), showing optimality of Lovász’s algorithm under the Unique Games conjecture. The NP-hardness result is based on a reduction from minimum vertex cover in r-uniform hypergraphs for which NP-hardness of approximating within r–1–ε was shown by Dinur et al. [5]. The Unique Games-hardness result is obtained by applying the recent results of Kumar et al. [15], with a slight modification, to the LP integrality gap due to Aharoni et al. [1]. The modification is to ensure that the reduction preserves the desired structural properties of the hypergraph.KeywordsConstraint Satisfaction ProblemVertex CoverColor ClassisVertex Cover ProblemMinimum Vertex CoverThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.