Approximation Algorithms For Scheduling On Uniform Processors (Q4202255)
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 404481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation Algorithms For Scheduling On Uniform Processors |
scientific article; zbMATH DE number 404481 |
Statements
Approximation Algorithms For Scheduling On Uniform Processors (English)
0 references
1 September 1993
0 references
scheduling independent tasks
0 references
uniform processors
0 references
maximum completion time
0 references
approximation schemes
0 references
0.93533325
0 references
0.9312881
0 references
0 references
0.92140347
0 references
0.9199565
0 references
0.9191081
0 references
