W[2]-hardness of precedence constrained K-processor scheduling
- 1 September 1995
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 18 (2), 93-97
- https://doi.org/10.1016/0167-6377(95)00031-9
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- Erratum “Optimal Sequencing of Two Equivalent Processors”SIAM Journal on Applied Mathematics, 1971
- Optimal Sequencing of Two Equivalent ProcessorsSIAM Journal on Applied Mathematics, 1969