Improved inapproximability results for maxclique, chromatic number and approximate graph coloring

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2001, Pages 600-609

  Khot, S ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; THEOREM PROVING;

HADAMARD CODES;

GRAPH THEORY;

EID: 0035176032     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.2001.959936     Document Type: Conference Paper

References (24)

1. Proof verification and the hardness of approximation problems
2. Probabilistic checking of proofs: A new characterization of NP
3. Free bits, PCPs and non-approximability
4. Approximating maximum independent sets by excluding subgraphs
5. 3/14) coloring algorithm for 3-colorable graphs
6. Improved non-approximability results
7. 1-o(1)
8. Randomized graph products, chromatic numbers, and the Lovasz θ-function
9. Approximating clique is almost NP-complete
10. Zero-knowledge and chromatic number
11. Improved hardness results for approximating the chromatic number
12. The complexity of near-optimal graph coloring
13. 1-∞
14. Some optimal inapproximability results
15. Query efficient PCPs with perfect completeness
16. Simple Analysis of graph tests for linearity and PCP
17. Approximate graph coloring by semidefinite programming
18. On the hardness of approximating the chromatic number
19. On the hardness of approximating minimization problems
20. A parallel repetition theorem
21. A PCP characterization of NP with optimal amortized query complexity
22. The value of strong inapproximability results for clique
23. Probabilistically checkable proofs with low amortized query complexity
24. Recycling queries in PCPs and in linearity tests