Greedy algorithms for on-line set-covering (Q2867360)
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: Greedy algorithms for on-line set-covering |
scientific article; zbMATH DE number 6237483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greedy algorithms for on-line set-covering |
scientific article; zbMATH DE number 6237483 |
Statements
11 December 2013
0 references
on-line algorithm
0 references
approximation algorithm
0 references
competitive ratio
0 references
set-covering
0 references
approximation ratio
0 references
Greedy algorithms for on-line set-covering (English)
0 references
0.8598580956459045
0 references
0.859296441078186
0 references
0.8171699047088623
0 references
0.7982257604598999
0 references
