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={S. Khot},
  journal={Proceedings 2001 IEEE International Conference on Cluster Computing},
  year={2001},
  pages={600-609}
}
  • S. 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… CONTINUE READING
    Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion
    • 78
    From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
    • 54
    • PDF
    Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique
    • S. Khot
    • Computer Science, Mathematics
    • 2004
    • 82
    Towards optimal lower bounds for clique and chromatic number
    • 29
    • PDF
    Graphs with tiny vector chromatic numbers and huge chromatic numbers
    • 23
    • PDF
    Hardness results for coloring 3-colorable 3-uniform hypergraphs
    • S. Khot
    • Computer Science, Mathematics
    • 2002
    • 80

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 40 REFERENCES
    Improved hardness results for approximating the chromatic number
    • 10
    • Highly Influential
    The value of strong inapproximability results for clique
    • 9
    Zero knowledge and the chromatic number
    • 247
    • Highly Influential
    On the Hardness of Approximating the Chromatic Number
    • 166
    Free bits, PCPs and non-approximability-towards tight results
    • 331
    • PDF
    The Complexity of Near-Optimal Graph Coloring
    • 275
    Some optimal inapproximability results
    • 1,640
    • Highly Influential
    • PDF
    Approximate graph coloring by semidefinite programming
    • 452
    • PDF
    On the hardness of approximating minimization problems
    • 546
    Randomized graph products, chromatic numbers, and the Lovász ϑ-function
    • U. Feige
    • Mathematics, Computer Science
    • 1997
    • 72