Lower bounds for on-line two-dimensional packing algorithms (Q1168732): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:00, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for on-line two-dimensional packing algorithms |
scientific article |
Statements
Lower bounds for on-line two-dimensional packing algorithms (English)
0 references
1982
0 references
two-dimensional bin packing
0 references
NP-hard
0 references
approximation algorithms
0 references
lower bounds for the worst-case performance of on-line algorithms
0 references
