Parameterized complexity of a coupled-task scheduling problem (Q2283295)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of a coupled-task scheduling problem |
scientific article |
Statements
Parameterized complexity of a coupled-task scheduling problem (English)
0 references
30 December 2019
0 references
coupled-task scheduling model
0 references
\( \mathsf{FPT}\) algorithms
0 references
\({\mathsf{W}}[1]\)-hardness
0 references
kernel lower bound
0 references
