Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907)
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: Shrinking maxima, decreasing costs: new online packing and covering problems |
scientific article; zbMATH DE number 6587980
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shrinking maxima, decreasing costs: new online packing and covering problems |
scientific article; zbMATH DE number 6587980 |
Statements
Shrinking maxima, decreasing costs: new online packing and covering problems (English)
0 references
31 May 2016
0 references
competitive analysis
0 references
randomized algorithm
0 references
packing integer programs
0 references
online set packing
0 references
team formation
0 references
prize-collecting multi-covering
0 references
0 references
0.9991826415061952
0 references
0.8400435447692871
0 references
0.8374013304710388
0 references
0.8131149411201477
0 references
0.800412118434906
0 references
