Parameterized complexity of a coupled-task scheduling problem (Q2283295)
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 7146961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity of a coupled-task scheduling problem |
scientific article; zbMATH DE number 7146961 |
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
0.8301907777786255
0 references
0.811678946018219
0 references
0.8019512891769409
0 references
0.7905077934265137
0 references
0.7831587791442871
0 references
