Under the auspices of the Computational Complexity Foundation (CCF)
We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-partite hypergraphs.
