Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation (Q3208073)
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: Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation |
scientific article; zbMATH DE number 3649981
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation |
scientific article; zbMATH DE number 3649981 |
Statements
Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation (English)
0 references
1979
0 references
scheduling
0 references
combinatorial algorithms
0 references
approximation algorithms
0 references
worst- case performance bounds
0 references
Np-completeness
0 references
bin-packing
0 references
processor and storage allocation
0 references
worst-case time complexity
0 references
