|
|
| |
| Universität Bonn -> Institut für Informatik -> Abteilung V | ||
| CS-APX-Reports 2011 | Copyright 2011 Universität Bonn, Institut für Informatik, Abt. V | |
|
89131 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
|
Universität Bonn -> Institut für Informatik -> Abteilung V | |