Improved performance of the greedy algorithm for partial cover (Q293139)
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: Improved performance of the greedy algorithm for partial cover |
scientific article; zbMATH DE number 6590643
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved performance of the greedy algorithm for partial cover |
scientific article; zbMATH DE number 6590643 |
Statements
Improved performance of the greedy algorithm for partial cover (English)
0 references
9 June 2016
0 references
approximation algorithms
0 references
combinatorial optimization
0 references
greedy algorithm
0 references
minimum cover
0 references
partial cover
0 references
set cover
0 references
0.8772010207176208
0 references
0.8522345423698425
0 references
0.8275731801986694
0 references
0.819908082485199
0 references
