Non-approximability of the bulk synchronous task scheduling problem (Q4813033)
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 2090587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-approximability of the bulk synchronous task scheduling problem |
scientific article; zbMATH DE number 2090587 |
Statements
12 August 2004
0 references
0.8034131526947021
0 references
0.760308563709259
0 references
0.7598862648010254
0 references
0.7597775459289551
0 references
0.7583007216453552
0 references
Non-approximability of the bulk synchronous task scheduling problem (English)
0 references
