Conditional Hardness for Approximate Coloring
Work
Year: 2009
Type: article
Abstract: We study the AprxColoring$(q,Q)$ problem: Given a graph G, decide whether $\chi(G)\le q$ or $\chi(G)\ge Q$. We present hardness results for this problem for any constants $3\le q<Q$. For $q\ge4$, our ... more
Source: SIAM Journal on Computing
Authors Irit Dinur, Elchanan Mossel, Oded Regev
Cites: 35
Cited by: 121
Related to: 10
FWCI: 7.521
Citation percentile (by year/subfield): 99.99
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green