A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma (Q4810508)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2091607
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma |
scientific article; zbMATH DE number 2091607 |
Statements
A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma (English)
0 references
16 August 2004
0 references
probabilistic method
0 references
Lovász Local Lemma
0 references
random trial
0 references
hypergraph coloring
0 references
0.9141788482666016
0 references
0.8920035362243652
0 references
0.8920035362243652
0 references
