Clique Is Hard to Approximate within n1-o(1)

Authors:
Lars Engebretsen;Jonas Holmerin
Affiliations:
-;-
Venue:
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Year:
2000

Citing 10
Cited 5

Approximating maximum independent sets by excluding subgraphs

BIT
Improved non-approximability results

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomized graph products, chromatic numbers, and Lovasz j-function

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Interactive proofs and the hardness of approximating cliques

Journal of the ACM (JACM)
On Unapproximable Versions of NP-Complete Problems

SIAM Journal on 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
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Clique is hard to approximate within n1-

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Complexity of Comparing Hidden Markov Models

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Go with the Winners Algorithms for Cliques in Random Graphs

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A hybrid graph representation for recursive backtracking algorithms

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
On the computation of some standard distances between probabilistic automata

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
The clique problem in ray intersection graphs

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

It was previously known that Max Clique cannot be approximated in polynomial time within n1-Ɛ, for any constant Ɛ 0, unless NP = ZPP. In this paper, we extend the reductions used to prove this result and combine the extended reductions with a recent result of Samorodnitsky and Trevisan to show that clique cannot be approximated within n1-O(1/√log log n) unless NP ⊆ ZPTIME(2O(log n(log log n)3/2)).