Marek Karpinski Richard Schmied Claus Viehmann Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs. 98 2011 18 Electronic Colloquium on Computational Complexity (ECCC) http://eccc.hpi-web.de/report/2011/098 db/journals/eccc/eccc18.html#KarpinskiSV11