๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Approximate coloring of uniform hypergraphs

โœ Scribed by Michael Krivelevich; Benny Sudakov

Book ID
108421631
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
194 KB
Volume
49
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximate Set Covering in Uniform Hype
Approximate Set Covering in Uniform Hypergraphs
โœ Michael Krivelevich ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 296 KB

The weighted set covering problem, restricted to the class of r-uniform hypergraphs, is considered. We propose a new approach, based on a recent result of Aharoni, Holzman, and Krivelevich about the ratio of integer and fractional covering numbers in k-colorable r-uniform hypergraphs. This approach,

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

Hardness of Approximate Hypergraph Color
Hardness of Approximate Hypergraph Coloring
โœ Guruswami, Venkatesan; Hastad, Johan; Sudan, Madhu ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 269 KB