Approximating coupled-task scheduling problems with equal exact delays (Q3133220)
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 6837850
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating coupled-task scheduling problems with equal exact delays |
scientific article; zbMATH DE number 6837850 |
Statements
Approximating Coupled-Task Scheduling Problems with Equal Exact Delays (English)
0 references
13 February 2018
0 references
couple-task scheduling
0 references
inapproximability lower bound
0 references
approximation algorithm
0 references
worst-case analysis
0 references
0.9523131847381592
0 references
0.9305007457733154
0 references
0.8987798094749451
0 references
0.876666784286499
0 references
0.8713110685348511
0 references
