Improving the performance guarantee for approximate graph coloring
Journal of the ACM (JACM)
Graph properties and hypergraph colourings
Discrete Mathematics
A still better performance guarantee for approximate graph coloring
Information Processing Letters
New approximation algorithms for graph coloring
Journal of the ACM (JACM)
The complexity of generalized graph colorings
Discrete Applied Mathematics
An Õ(n3/14)-coloring algorithm for 3-colorable graphs
Information Processing Letters
Approximating coloring and maximum independent sets in 3-uniform hypergraphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Hardness results for approximate hypergraph coloring
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The Hardness of 3 - Uniform Hypergraph Coloring
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Hardness Results for Coloring 3 -Colorable 3 -Uniform Hypergraphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Coloring Bipartite Hypergraphs
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximating Maximum Independent Sets in Uniform Hypergraphs
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Approximate Hypergraph Coloring
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Coloring 2-colorable hypergraphs with a sublinear number of colors
Nordic Journal of Computing
Zero Knowledge and the Chromatic Number
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Hardness of approximate hypergraph coloring
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Longest common subsequence problem for unoriented and cyclic strings
Theoretical Computer Science
Approximating Independent Set and Coloring in Random Uniform Hypergraphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Combining fragmentation and encryption to protect privacy in data storage
ACM Transactions on Information and System Security (TISSEC)
Fragmentation and encryption to enforce privacy in data storage
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
| Hi-index | 0.00 |
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 n1-ε for any ε 0, unless NP ⊆ ZPP. On the positive side, improving a result of Hofmeister and Lefmann, we present an approximation algorithm for coloring r-uniform hypergraphs on n vertices, whose performance ratio is O(n(log logn)2/(logn)2).