Recognition: unknown
Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs
classification
💻 cs.DS
keywords
approximationboundscoverdensehypergraphsk-partitetightvertex
read the original abstract
We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-partite hypergraphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.