It is hard to know when greedy is good for finding independent sets (Q286978)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | It is hard to know when greedy is good for finding independent sets |
scientific article |
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
