A new multilayered PCP and the hardness of hypergraph vertex cover

Irit Dinur, Subhash Khot, Venkatesan Guruswami, Oded Regev

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Given a k-uniform hyper-graph, the Ek-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 Ek-Vertex-Cover is NP-hard to approximate within factor (k -1 - ε) for any k ≥ 3 and any ε > 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.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the Annual ACM Symposium on Theory of Computing
Pages595-601
Number of pages7
StatePublished - 2003
Event35th Annual ACM Symposium on Theory of Computing - San Diego, CA, United States
Duration: Jun 9 2003Jun 11 2003

Other

Other35th Annual ACM Symposium on Theory of Computing
CountryUnited States
CitySan Diego, CA
Period6/9/036/11/03

Fingerprint

Hardness

Keywords

  • Hardness of Approximation
  • Hypergraph Vertex Cover
  • Long Code
  • Multilayered PCP

ASJC Scopus subject areas

  • Software

Cite this

Dinur, I., Khot, S., Guruswami, V., & Regev, O. (2003). A new multilayered PCP and the hardness of hypergraph vertex cover. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 595-601)

A new multilayered PCP and the hardness of hypergraph vertex cover. / Dinur, Irit; Khot, Subhash; Guruswami, Venkatesan; Regev, Oded.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2003. p. 595-601.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dinur, I, Khot, S, Guruswami, V & Regev, O 2003, A new multilayered PCP and the hardness of hypergraph vertex cover. in Conference Proceedings of the Annual ACM Symposium on Theory of Computing. pp. 595-601, 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, United States, 6/9/03.
Dinur I, Khot S, Guruswami V, Regev O. A new multilayered PCP and the hardness of hypergraph vertex cover. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2003. p. 595-601
Dinur, Irit ; Khot, Subhash ; Guruswami, Venkatesan ; Regev, Oded. / A new multilayered PCP and the hardness of hypergraph vertex cover. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2003. pp. 595-601
@inproceedings{60c61be61b354dd3bea2cefb6a1eb46a,
title = "A new multilayered PCP and the hardness of hypergraph vertex cover",
abstract = "Given a k-uniform hyper-graph, the Ek-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 Ek-Vertex-Cover is NP-hard to approximate within factor (k -1 - ε) for any k ≥ 3 and any ε > 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.",
keywords = "Hardness of Approximation, Hypergraph Vertex Cover, Long Code, Multilayered PCP",
author = "Irit Dinur and Subhash Khot and Venkatesan Guruswami and Oded Regev",
year = "2003",
language = "English (US)",
pages = "595--601",
booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

}

TY - GEN

T1 - A new multilayered PCP and the hardness of hypergraph vertex cover

AU - Dinur, Irit

AU - Khot, Subhash

AU - Guruswami, Venkatesan

AU - Regev, Oded

PY - 2003

Y1 - 2003

N2 - Given a k-uniform hyper-graph, the Ek-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 Ek-Vertex-Cover is NP-hard to approximate within factor (k -1 - ε) for any k ≥ 3 and any ε > 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.

AB - Given a k-uniform hyper-graph, the Ek-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 Ek-Vertex-Cover is NP-hard to approximate within factor (k -1 - ε) for any k ≥ 3 and any ε > 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.

KW - Hardness of Approximation

KW - Hypergraph Vertex Cover

KW - Long Code

KW - Multilayered PCP

UR - http://www.scopus.com/inward/record.url?scp=0038107530&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038107530&partnerID=8YFLogxK

M3 - Conference contribution

SP - 595

EP - 601

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

ER -