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
Created claim: Wikidata QID (P12): Q124987154, #quickstatements; #temporary_batch_1711486624475 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4828988 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4247194 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4542572 / rank | |||
Normal rank | |||
Latest revision as of 20:01, 6 June 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
