A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Approximate coloring of uniform hypergraphs
2003
Journal of Algorithms
We consider an algorithmic problem of coloring r-uniform hypergraphs. The problem of finding the exact value of the chromatic number of a hypergraph is known to be NP-hard, so we discuss approximate solutions to it. Using a simple construction and known results on hardness of graph coloring, we show that for any r 3 it is impossible to approximate in polynomial time the chromatic number of r-uniform hypergraphs on n vertices within a factor n 1− for any > 0, unless NP ⊆ ZPP. On the positive
doi:10.1016/s0196-6774(03)00077-4
fatcat:u5j6a2xjnralxixk73h7xypnqm