Approximation algorithms for scheduling trees with general communication delays: Special issue on task scheduling problems for parallel and distributed systems (Q1285547)
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 1281057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for scheduling trees with general communication delays: Special issue on task scheduling problems for parallel and distributed systems |
scientific article; zbMATH DE number 1281057 |
Statements
Approximation algorithms for scheduling trees with general communication delays: Special issue on task scheduling problems for parallel and distributed systems (English)
0 references
28 April 1999
0 references
general communication delays
0 references
scheduling
0 references
task duration
0 references
makespan
0 references
0.8699296712875366
0 references
0.866480827331543
0 references
0.8556668758392334
0 references
0.8462727665901184
0 references
0.8435606360435486
0 references
