Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Greed is good: Approximating independent sets in sparse and bounded-degree graphs |
scientific article; zbMATH DE number 1002572
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greed is good: Approximating independent sets in sparse and bounded-degree graphs |
scientific article; zbMATH DE number 1002572 |
Statements
Greed is good: Approximating independent sets in sparse and bounded-degree graphs (English)
0 references
20 July 1997
0 references
minimum-degree greedy algorithm
0 references
0.984568417072296
0 references
0.8850138783454895
0 references
0.8690471649169922
0 references
0.8586702346801758
0 references
