A still better performance guarantee for approximate graph coloring
Information Processing Letters
Approximation algorithms
Approximating Maximum Independent Sets in Uniform Hypergraphs
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Zero Knowledge and the Chromatic Number
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Approximate coloring of uniform hypergraphs
Journal of Algorithms
Approximating Maximum Clique by Removing Subgraphs
SIAM Journal on Discrete Mathematics
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
| Hi-index | 0.01 |
We consider the problems Independent Set and Coloring in uniform hypergraphs with nvertices. If $\mathcal{NP} \not \subseteq \mathcal{ZPP}$, there are no polynomial worst case running time approximation algorithms with approximation guarantee n1 茂戮驴 茂戮驴for any 茂戮驴 0. We show that the problems are easier to approximate in polynomial expected running time for random hypergraphs. For d茂戮驴 2, we use the Hd(n,p) model of random d-uniform hypergraphs on nvertices, choosing the edges independently with probability p. We give deterministic algorithms with polynomial expected running time for random inputs from Hd(n,p), and approximation guarantee O(n1/2·p茂戮驴 (d茂戮驴 3)/(2d茂戮驴 2)/(ln n)1/(d茂戮驴 1)).