Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs
arXiv:1107.2000
Abstract
We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-partite hypergraphs.
arXiv:1107.2000
We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-partite hypergraphs.