\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59567993, #quickstatements; #temporary_batch_1707216511891 |
Removed claim: author (P16): Item:Q242851 |
||
| Property / author | |||
| Property / author: Hans L. Bodlaender / rank | |||
Revision as of 17:30, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling |
scientific article |
Statements
\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (English)
0 references
1 August 1996
0 references
multiprocessor scheduling
0 references
partial orders
0 references
precedence constrained \(K\)-processor scheduling
0 references
parameterized complexity
0 references
