Tight Approximation Bounds for Vertex Cover on Dense k-Partite   Hypergraphs
  We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-partite hypergraphs. 
Marek Karpinski, Richard Schmied, Claus Viehmann
cs.DS