37 search results - page 1 / 8 » Hardness of Approximate Hypergraph Coloring |
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
IANDC
2007
13 years 4 months ago
2007
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
WAOA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
SODA
2001
ACM
13 years 6 months ago
2001
ACM