Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion

  title={Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion},
  author={Subhash Khot and Ashok Kumar Ponnuswami},
We prove an improved hardness of approximation result for two problems, namely, the problem of finding the size of the largest clique in a graph and the problem of finding the chromatic number of a graph. We show that for any constant γ > 0, there is no polynomial time algorithm that approximates these problems within factor n/2 n) 3/4+γ in an n vertex graph, assuming NP * BPTIME(2 n) O(1) ). This improves the hardness factor of n/2 n) 1−γ′ for some small (unspecified) constant γ > 0 shown by… CONTINUE READING
Highly Cited
This paper has 69 citations. REVIEW CITATIONS
45 Citations
29 References
Similar Papers


Publications citing this paper.

70 Citations

Citations per Year
Semantic Scholar estimates that this publication has 70 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 29 references

Randomized graph products , chromatic numbers , and the lovász θ - function Approximating maximum clique by removing subgraphs

  • S. Goldwasser Feige, L. Lovász, S. Safra, M. Szegedy
  • SIAM J . Discrete Math .
  • 2004

Similar Papers

Loading similar papers…