It is hard to know when greedy is good for finding independent sets (Q286978)
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: It is hard to know when greedy is good for finding independent sets |
scientific article; zbMATH DE number 6585370
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | It is hard to know when greedy is good for finding independent sets |
scientific article; zbMATH DE number 6585370 |
Statements
It is hard to know when greedy is good for finding independent sets (English)
0 references
26 May 2016
0 references
analysis of algorithms
0 references
combinatorial problems
0 references
approximation algorithms
0 references
0.8681445
0 references
0.84201133
0 references
0.84201133
0 references
0.8309844
0 references
0.8259259
0 references
0.82074714
0 references
0.81931967
0 references
0.8164513
0 references
