On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q6089672)
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 fine-grained parameterized complexity of partial scheduling to minimize the makespan |
scientific article; zbMATH DE number 7764116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the fine-grained parameterized complexity of partial scheduling to minimize the makespan |
scientific article; zbMATH DE number 7764116 |
Statements
13 November 2023
0 references
fixed-parameter tractability
0 references
scheduling
0 references
precedence constraints
0 references
0 references
0 references
0.9969317317008972
0 references
0.7801358103752136
0 references
0.7728986740112305
0 references
0.7662899494171143
0 references
0.764517605304718
0 references
