Lower bounds for on-line two-dimensional packing algorithms (Q1168732): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00264439 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1972899329 / rank | |||
Normal rank | |||
Latest revision as of 09:55, 30 July 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
