A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma (Q4810508): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/rsa.20016 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091047457 / rank | |||
Normal rank | |||
Revision as of 03:40, 20 March 2024
scientific article; zbMATH DE number 2091607
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
