A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing (Q1299865)
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 \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing |
scientific article; zbMATH DE number 1328426
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing |
scientific article; zbMATH DE number 1328426 |
Statements
A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing (English)
0 references
11 November 1999
0 references
on-line algorithm
0 references
worst-case analysis
0 references
bin packing problem
0 references
