Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs

Authors:
Oded Goldreich
Affiliations:
Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, Israel
Venue:
Studies in complexity and cryptography
Year:
2011

Citing 15
Cited 0

Approximating clique is almost NP-complete (preliminary version)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The hardness of approximation: gap location

Computational Complexity
Some optimal inapproximability results

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
Free Bits, PCPs, and Nonapproximability---Towards Tight Results

SIAM Journal on Computing
Non-approximability results for optimization problems on bounded degree instances

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The importance of being biased

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - &egr;

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness

Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Clique is hard to approximate within n1-

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Query Efficient PCPs with Perfect Completeness

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover

SIAM Journal on Computing
Vertex cover might be hard to approximate to within 2-ε

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using known results regarding PCP, we present simple proofs of the inapproximability of vertex cover for hypergraphs. Specifically, we show that 1. Approximating the size of the minimum vertex cover in O(1)-regular hypergraphs to within a factor of 1.99999 is NP-hard.