Semi-on-line bin packing: a short overview and a new lower bound (Q301113)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6599503
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Semi-on-line bin packing: a short overview and a new lower bound |
scientific article; zbMATH DE number 6599503 |
Statements
Semi-on-line bin packing: a short overview and a new lower bound (English)
0 references
29 June 2016
0 references
bin packing
0 references
semi-on-line algorithms
0 references
asymptotic competitive ratio
0 references
lower bound
0 references
0 references
0 references
0.8818541765213013
0 references
0.8500839471817017
0 references
0.8436314463615417
0 references
0.8432924747467041
0 references
0.8425441980361938
0 references
