# Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring

@article{Khot2001ImprovedIR,
title={Improved inapproximability results for MaxClique, chromatic number and approximate graph coloring},
author={Subhash Khot},
journal={Proceedings 2001 IEEE International Conference on Cluster Computing},
year={2001},
pages={600-609}
}
• Subhash Khot
• Published 2001
• Computer Science
• Proceedings 2001 IEEE International Conference on Cluster Computing
The author presents improved inapproximability results for three problems: the problem of finding the maximum clique size in a graph, the problem of finding the chromatic number of a graph, and the problem of coloring a graph with a small chromatic number with a small number of colors. J. Hastad's (1996) result shows that the maximum clique size in a graph with n vertices is inapproximable in polynomial time within a factor n/sup 1-/spl epsi// or arbitrarily small constant /spl epsi/>0 unless… Expand
201 Citations

#### Topics from this paper

Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion
• Mathematics, Computer Science
• ICALP
• 2006
It is shown that for any constant γ> 0, there is no polynomial time algorithm that approximates these problems within factor $n/2^{(\log n)^{3/4+\gamma}}$ in an n vertex graph, assuming ${\rm NP} \nsubseteq {\rm BPTIME}(2^{log n]^{O(1)}})$. Expand
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
• Computer Science, Mathematics
• STOC
• 2013
We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the"short code" of Barak et. al. [FOCS 2012]) and the techniques proposed by Dinur andExpand
Towards optimal lower bounds for clique and chromatic number
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 2001
The reductions used to prove these results are extended and combined with a recent result of Samorodnitsky and Trevisan to show that unless NP ⊆ ZPTIME(2O(log n(log log n)3/2), neither Max Clique nor Min Chromatic Number can be approximated in polynomial time within n1-e(n). Expand
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
It is shown that both Clique and DomSet admit no non-trivial FPT-approximation algorithm, and the results hold under the Gap Exponential Time Hypothesis (Gap-ETH) which states that no 2^{o(n)}-time algorithm can distinguish between a satisfiable 3SAT formula and one which is not even (1 - c)-satisfiable for some constant c &#x2248; 0. Expand
Reducing the optimum value : FPT inapproximability , for Set
• 2013
Fixed parameter ρ(k) inapproximability in minimization problems, is given some instance I of a problem with optimum opt, find some k ≥ opt and prove that it is not possible to compute a solution ofExpand
Graphs with tiny vector chromatic numbers and huge chromatic numbers
• Mathematics, Computer Science
• The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
• 2002
The bounds on the sample size improve previous bounds of Goldreich, Goldwasser and Ron (1998) for this problem and analyze "property testing" algorithms that distinguish between graphs that have an independent set of size n/k, and graphs that are "far" from having such anindependent set. Expand
Constant factor approximation of MAX CLIQUE
• Mathematics, Computer Science
• ArXiv
• 2019
It is shown that MCP can be approximated with a constant factor in polynomial time through approximation ratio preserving reductions from MCP toMAX DNF and from MAX DNF to MIN SAT. Expand
Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis
Conditional inapproximability results with essentially optimal ratios for the following graph problems based on the Small Set Expansion Hypothesis are proved: Maximum Edge Biclique, Maximum Balanced Bicles, Minimum k-Cut and Densest At-Least-k-Subgraph. Expand
Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique
It is shown that graph min-bisection, densest subgraph and bipartite clique have no PTAS, and a way of certifying that a given polynomial belongs to a given subspace of polynomials is given. Expand
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
• Computer Science, Mathematics
• SODA
• 2012
The results indicate that approximating Densest k-subgraph within a polynomial factor might be a harder problem than Unique Games or Small Set Expansion, since these problems were recently shown to be solvable using neΩ(1) rounds of the Lasserre hierarchy, where e is the completeness parameter in Unique Games and Small Set expansion. Expand

#### References

SHOWING 1-10 OF 39 REFERENCES
Improved hardness results for approximating the chromatic number
• M. Furer
• Proceedings of IEEE 36th Annual Foundations of Computer Science
• 1995
First, a simplified geometric proof is presented for the result of C. Lund and M. Yannakakis (1994) saying that for some /spl epsiv/>0 it is NP-hard to approximate the chromatic number of graphs withExpand
The value of strong inapproximability results for clique
It is shown that for some such clique approximation problems that seem likely to require superpolynomial time in view of the results of Engebretsen and Holmerin, even certain low-degree polynomial lower bounds on their complexity will prove that N P ~ P. Expand
Zero knowledge and the chromatic number
• Mathematics, Computer Science
• Proceedings of Computational Complexity (Formerly Structure in Complexity Theory)
• 1996
A new technique, inspired by zero-knowledge proof systems, is presented for proving lower bounds on approximating the chromatic number of a graph, and the result matches (up to low order terms) the known gap for approximation the size of the largest independent set. Expand
The Complexity of Near-Optimal Graph Coloring
• Mathematics, Computer Science
• J. ACM
• 1976
It is proved that even coming close to khgr;(G) with a fast algorithm is hard, and it is shown that if for some constant r < 2 and constant d there exists a polynomial-time algorithm A which guarantees A(G). Expand
On the Hardness of Approximating the Chromatic Number
• Mathematics, Computer Science
• Comb.
• 2000
It is NP-hard to find a 4-coloring of a 3-chromatic graph and as an immediate corollary it is obtained that it isNP- hard to color a k- chromatic graph with at most colors. Expand
Free bits, PCPs and non-approximability-towards tight results
• Computer Science, Mathematics
• Proceedings of IEEE 36th Annual Foundations of Computer Science
• 1995
A proof system for NP is presented using logarithmic randomness and two amortized free bits, so that Max clique is hard within N/sup 1/3/ and chromatic number within N-Sup 1/5/, and a comprehensive study of PCP and FPCP parameters is initiated. Expand
Randomized graph products, chromatic numbers, and the Lovász ϑ-function
• U. Feige
• Mathematics, Computer Science
• Comb.
• 1997
It is proved that for somec>0, there exists an infinite family of graphs such that vartheta (G) > α (G), n/2 c-sqrt {\log n} , wheren denotes the number of vertices in a graph. Expand
Approximate graph coloring by semidefinite programming
• Mathematics, Computer Science
• JACM
• 1998
A duality relationship established between the value of the optimum solution to the authors' semidefinite program and the Lovász &thgr;-function is established and lower bounds on the gap between the best known approximation ratio in terms of n are shown. Expand
Approximating Maximum Independent Sets by Excluding Subgraphs 1
An approximation algorithm for the maximum independent set problem is given, improving the best performance guarantee known to O(n=(logn) 2 ). We also obtain the same performance guarantee for graphExpand
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