Tight bounds for NF-based bounded-space online bin packing algorithms (Q1702819)
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 6845568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds for NF-based bounded-space online bin packing algorithms |
scientific article; zbMATH DE number 6845568 |
Statements
Tight bounds for NF-based bounded-space online bin packing algorithms (English)
0 references
1 March 2018
0 references
semi-online bin-packing
0 references
bounded-space
0 references
asymptotic competitive ratio
0 references
next-fit
0 references
lower bound
0 references
0.8672459721565247
0 references
0.8535435795783997
0 references
0.7982121706008911
0 references
