A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game (Q2294729)
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: A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game |
scientific article |
Statements
A tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game (English)
0 references
12 February 2020
0 references
0.8931146264076233
0 references
0.8780828714370728
0 references
0.8376983404159546
0 references
0.8278642892837524
0 references
0.826630711555481
0 references
