Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-Reports 2011 Copyright 2011 University of Bonn, Department of Computer Science, Abt. V
85322

11.07.2011

Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs
Marek Karpinski, Richard Schmied and Claus Viehmann
[Download PostScript] [Download PDF]

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

Last Change: 11/05/14 at 10:56:57
 Deutsch 		University of Bonn -> Department of Computer Science -> Chair V