Improved hardness results for approximating the chromatic number

Authors:
M. Furer
Affiliations:
-
Venue:
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Year:
1995

Citing 0
Cited 6

The approximability of NP-hard problems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
Towards optimal lower bounds for clique and chromatic number

Theoretical Computer Science
Conditional hardness for approximate coloring

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Online vertex colorings of random graphs without monochromatic subgraphs

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Inapproximability Results for Wavelength Assignment in WDM Optical Networks

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

First, a simplified geometric proof is presented for the result of C. Lund and M. Yannakakis (1994) saying that for some /spl epsiv/