A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

Details A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

2003-04-19

arxiv.org/abs/cs/0304026v1

Computer Science

Computational Complexity

Scientific paper

Given a $k$-uniform hyper-graph, the E$k$-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyper-edge. We present a new multilayered PCP construction that extends the Raz verifier. This enables us to prove that E$k$-Vertex-Cover is NP-hard to approximate within factor $(k-1-\epsilon)$ for any $k \geq 3$ and any $\epsilon>0$. The result is essentially tight as this problem can be easily approximated within factor $k$. Our construction makes use of the biased Long-Code and is analyzed using combinatorial properties of $s$-wise $t$-intersecting families of subsets.

Affiliated with

Also associated with

No associations

Rating

A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover 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 A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-349537