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 the normal view instead:
scientific article; zbMATH DE number 1309388
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8169201612472534
0 references
0.8168458938598633
0 references
0.7938172221183777
0 references
