On the parametric complexity of schedules to minimize tardy tasks. (Q1874274)
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 1915465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parametric complexity of schedules to minimize tardy tasks. |
scientific article; zbMATH DE number 1915465 |
Statements
On the parametric complexity of schedules to minimize tardy tasks. (English)
0 references
25 May 2003
0 references
parameterized complexity theory
0 references
0.8095792531967163
0 references
0.7943956851959229
0 references
0.7912151217460632
0 references
0.7906304001808167
0 references
0.7905077934265137
0 references
