Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs

Details Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs

2011-07-11

arxiv.org/abs/1107.2000v1

Computer Science

Data Structures and Algorithms

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-137661