Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs

Abstract

We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-partite hypergraphs.