Approximation algorithms for partitioning small items in unequal bins to minimize the total size (Q1293199)
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: Approximation algorithms for partitioning small items in unequal bins to minimize the total size |
scientific article; zbMATH DE number 1309388
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for partitioning small items in unequal bins to minimize the total size |
scientific article; zbMATH DE number 1309388 |
Statements
Approximation algorithms for partitioning small items in unequal bins to minimize the total size (English)
0 references
28 June 1999
0 references
bin-packing
0 references
multiprocessor scheduling
0 references
on-line algorithm
0 references
scheduling algorithm
0 references
