The greedier the better: An efficient algorithm for approximating maximum independent sets (Q4938679)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1405697
| 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 sets |
scientific article; zbMATH DE number 1405697 |
Statements
5 July 2000
0 references
polynomial-time algorithm
0 references
greedy heuristic
0 references
independent sets
0 references
ratio bound
0 references
0.9859214425086976
0 references
0.8907797932624817
0 references
0.8766598105430603
0 references
0.8754175901412964
0 references
0.8532536625862122
0 references
The greedier the better: An efficient algorithm for approximating maximum independent sets (English)
0 references
