A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case (Q1208477)
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 simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case |
scientific article; zbMATH DE number 166472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case |
scientific article; zbMATH DE number 166472 |
Statements
A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case (English)
0 references
16 May 1993
0 references
lower bound
0 references
bin packing
0 references
0.8920990228652954
0 references
0.8917978405952454
0 references
0.8438549637794495
0 references
0.8168055415153503
0 references
0.812999427318573
0 references
