# Approximating clique is almost NP-complete

@article{Feige1991ApproximatingCI,
title={Approximating clique is almost NP-complete},
author={Uriel Feige and Shafi Goldwasser and L{\'a}szl{\'o} Mikl{\'o}s Lov{\'a}sz and Shmuel Safra and Mario Szegedy},
journal={[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science},
year={1991},
pages={2-12}
}
• U. Feige, +2 authors M. Szegedy
• Published 1991
• Mathematics, Computer Science
• [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
The computational complexity of approximating omega (G), the size of the largest clique in a graph G, within a given factor is considered. It is shown that if certain approximation procedures exist, then EXPTIME=NEXPTIME and NP=P.<<ETX>>
491 Citations

#### Topics from this paper

The importance of being biased
• Computer Science, Mathematics
• STOC '02
• 2002
(MATH) We show that the Minimum Vertex Cover problem is NP-hard to approximate to within any factor smaller than $10\sqrt{5}-21 \approx 1.36067$, improving on the previously known hardness result forExpand
On the hardness of approximating minimum vertex cover
• Mathematics
• 2005
We prove the Minimum Vertex Cover problem to be NP-hard to approximate to within a factor of 1.3606, extending on previous PCP and hardness of approximation technique. To that end, one needs toExpand
Vertex cover might be hard to approximate to within 2-/spl epsiv/
• Mathematics, Computer Science
• 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.
• 2003
A stronger result is shown, namely, that, based on the same conjecture, vertex cover on k-uniform hypergraphs is hard to approximate within any constant factor better than k. Expand
A Polynomial Time Solution to the Clique Problem
• Computer Science, Mathematics
• ArXiv
• 2014
A computer program in C language has been written to validate the easiness of the algorithm to evolve a polynomial time algorithm for the Clique Problem. Expand
Improved Hardness of Approximating Chromatic Number
We prove that for sufficiently large K, it is NP-hard to color K-colorable graphs with less than $$2^{\Omega(K^{1/3})}$$ colors. This improves the previous result of K versus \(K^{\frac{1}{25}\logExpand
The Approximation of Maximum Subgraph Problems
• Mathematics, Computer Science
• ICALP
• 1993
It is shown that the problem to find the maximum number of nodes inducing a subgraph that satisfies a desired property π on directed or undirected graphs that is nontrivial and hereditary on induced subgraphs is hard to approximate. Expand
On the hardness of approximating minimization problems
• Mathematics, Computer Science
• STOC '93
• 1993
It is proved that there is an c >0 such that Graph Coloring cannot be approximated with ratio n’ unless P=NP unless NP is contained in DTIME[nPOIY log ~ ]. Expand
Approximation hardness of edge dominating set problems
• Mathematics, Computer Science
• J. Comb. Optim.
• 2006
It is NP-hard to approximate the solution of both problems to within any constant factor smaller than 7-6, the first interesting explicit lower bounds on efficient approximability for two closely related optimization problems in graphs. Expand
On the hardness of approximating minimization problems
• Mathematics, Computer Science
• JACM
• 1994
It is proved that there is an e > 0 such that Graph Coloring cannot be approximated with ratio n e unless P = NP, and Set Covering cannot be approximation with ratio c log n for any c < 1/4 unless NP is contained in DTIME(n poly log n). Expand
Approximation Algorithms for Maxsat
The main aim of NP-completeness theory is the analysis of intractabil-ity. Many optimization problems were rst proved to be NP-hard. Since the complete solution of these problems requires exponentialExpand

#### References

SHOWING 1-10 OF 18 REFERENCES
On the Complexity of Approximating the Independent Set Problem
• Mathematics, Computer Science
• STACS
• 1989
We show that for some positive constant c it is not feasible to approximate Independent Set (for graphs of n nodes) within a factor of n c , provided Maximum 2-Satisfiability does not have aExpand
Approximating Maximum Independent Sets by Excluding Subgraphs
• Computer Science, Mathematics
• BIT
• 1990
An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known to n/(log n)2, and this can be combined into a surprisingly strong simultaneous performance guarantee for the clique and coloring problems. Expand
Improving the performance guarantee for approximate graph coloring
This paper presents an efficient algorithm with performance guarantee of O(n(loglog n)2/(logn)2) for graphs on n vertices. Expand
Graph products and chromatic numbers
• Mathematics, Computer Science
• 30th Annual Symposium on Foundations of Computer Science
• 1989
Evidence is provided that it is inherently impossible to achieve a better than n/sup epsilon / ratio in polynomial time by showing that 'breaking the n/Sup epsilus / barrier' will automatically lead to vastly better polynometric-time approximation algorithms that achieve ratios closer to log n. Expand
IP = PSPACE
• A. Shamir
• Mathematics, Computer Science
• JACM
• 1992
In this paper, it is proven that when both randomization and interaction are allowed, the proofs that can be verified in polynomial time are exactly those proofs that can be generated with polynomialExpand
Optimization, approximation, and complexity classes
• Mathematics, Computer Science
• STOC '88
• 1988
A natural variant of NP, MAX NP, and also a subclass called MAX SNP are defined, which contain several natural, well-studied classes of optimization problems, and it is shown that problems in these classes can be approximated with some bounded error. Expand
The monotone circuit complexity of boolean functions
• Mathematics, Computer Science
• Comb.
• 1987
The arguments of Razborov are modified to obtain exponential lower bounds for circuits, and the best lower bound for an NP function ofn variables is exp (Ω(n1/4 · (logn)1/2)), improving a recent result of exp ( Ω( n1/8-ε)) due to Andreev. Expand
On the power of multi-power interactive protocols
• Computer Science
• [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
• 1988
A simple characterization of the power of the multipower model in terms of probabilistic oracle Turing machines is given. It is shown that languages that have single-prover interactive protocols alsoExpand
Multi-oracle interactive protocols with space bounded verifiers
• Computer Science, Mathematics
• [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
• 1989
It is proved that both in the multiprover model of M. Ben-or et al. and in the noisy oracle model of U. Feige et al, a finite-state verifier can accept any recursive language. Expand
Quantifiers and approximation
• Mathematics, Computer Science
• STOC '90
• 1990
It is shown that many impor-taut optimization problems do not belong to MAX NP and that in fact there are problems in P which are not ill lk'IAX NP, and it is proved that several natural optimization problems are complete for MAX H1 under approxima. Expand