On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications (Q3148374)
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: On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications |
scientific article; zbMATH DE number 1810531
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications |
scientific article; zbMATH DE number 1810531 |
Statements
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications (English)
0 references
30 September 2002
0 references
scheduling
0 references
hierarchical communications
0 references
non-approximability
0 references
0.8188342452049255
0 references
0.7969491481781006
0 references
