Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > DENSE K-PARTITE INSTANCES:
Reports tagged with Dense k-Partite Instances:
TR11-098 | 11th July 2011
Marek Karpinski, Richard Schmied, Claus Viehmann

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.

more >>>



ISSN 1433-8092 | Imprint