The Complexity of Scheduling Trees with Communication Delays (Q4864438)
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 845872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Scheduling Trees with Communication Delays |
scientific article; zbMATH DE number 845872 |
Statements
The Complexity of Scheduling Trees with Communication Delays (English)
0 references
20 February 1996
0 references
minimum-length schedule
0 references
0.9067038297653198
0 references
0.8781579732894897
0 references
0.8732926845550537
0 references
0.868610680103302
0 references
