𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hardness of Approximate Hypergraph Coloring

✍ Scribed by Guruswami, Venkatesan; Hastad, Johan; Sudan, Madhu

Book ID
118180391
Publisher
Society for Industrial and Applied Mathematics
Year
2002
Tongue
English
Weight
269 KB
Volume
31
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Hardness of 3-Uniform Hypergraph Col
The Hardness of 3-Uniform Hypergraph Coloring
✍ Irit Dinur*; Oded Regev†; Clifford Smyth‑ πŸ“‚ Article πŸ“… 2005 πŸ› Springer-Verlag 🌐 English βš– 263 KB
Conditional Hardness for Approximate Col
Conditional Hardness for Approximate Coloring
✍ Dinur, Irit; Mossel, Elchanan; Regev, Oded πŸ“‚ Article πŸ“… 2009 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 387 KB
Applications of hypergraph coloring to c
Applications of hypergraph coloring to coloring graphs not inducing certain trees
✍ H.A. Kierstead; V. Rodl πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 385 KB

We present a simple result on coloring hypergraphs and use it to obtain bounds on the chromatic number of graphs which do not induce certain trees. ## O. Introduction A class of graphs F is said to be x-bounded if there exists a functionfsuch that for all graphs G e F, (.) z(G) <~f(og(G)), where

Approximating Coloring and Maximum Indep
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs
✍ Michael Krivelevich; Ram Nathaniel; Benny Sudakov πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 120 KB

We discuss approximation algorithms for the coloring problem and the maximum independent set problem in 3-uniform hypergraphs. An algorithm for coloring ˜1r5 Ε½ . ## 3-uniform 2-colorable hypergraphs in O n colors is presented, improving previously known results. Also, for every fixed β₯ ) 1r2, we