Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms (Q4051589): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:56, 6 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms |
scientific article |
Statements
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms (English)
0 references
1975
0 references
