Greed is good: approximating independent sets in sparse and bounded-degree graphs (Q2817635)
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 6621815
| 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 6621815 |
Statements
1 September 2016
0 references
Greed is good: approximating independent sets in sparse and bounded-degree graphs (English)
0 references
0.984568417072296
0 references
0.9036318063735962
0 references
0.886990487575531
0 references
0.873620331287384
0 references
