The greedier the better: an efficient algorithm for approximating maximum independent set (Q5952051)
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: The greedier the better: an efficient algorithm for approximating maximum independent set |
scientific article; zbMATH DE number 1687625
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The greedier the better: an efficient algorithm for approximating maximum independent set |
scientific article; zbMATH DE number 1687625 |
Statements
The greedier the better: an efficient algorithm for approximating maximum independent set (English)
0 references
8 January 2002
0 references
greedy algorithms
0 references
approximation
0 references
combinatorial optimization
0 references
maximum independent set
0 references
0.8726524114608765
0 references
0.8661571741104126
0 references
0.8586702346801758
0 references
0.8377900123596191
0 references
