A new upper bound for the online square packing problem in a strip (Q2012894)
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 6756030
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new upper bound for the online square packing problem in a strip |
scientific article; zbMATH DE number 6756030 |
Statements
A new upper bound for the online square packing problem in a strip (English)
0 references
3 August 2017
0 references
strip packing
0 references
square packing
0 references
online algorithm
0 references
competitive ratio
0 references
0.902015745639801
0 references
0.8888140320777893
0 references
0.8493269681930542
0 references
0.8485981225967407
0 references
0.845018744468689
0 references
