Highly Influenced

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

@inproceedings{Khot2006BetterIR, title={Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion}, author={Subhash Khot and Ashok Kumar Ponnuswami}, booktitle={ICALP}, year={2006} }

- Published 2006 in ICALP
DOI:10.1007/11786986_21

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

#### From This Paper

##### Figures, tables, and topics from this paper.

45 Citations

29 References

Similar Papers

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 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.