W[2]-hardness of precedence constrained K-processor scheduling

Abstract

It is shown that the Precedence Constrained K-Processor Scheduling problem is W [2]-hard. This means that there does not exist a constant c, such that for all xed K, the Precedence Constrained K-Processor Scheduling problem can be solved in O(nc) time, unless an unlikely collapse occurs in the parameterized complexity hierarchy introduced by Downey and… (More)
DOI: 10.1016/0167-6377(95)00031-9

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics