Pages that link to "Item:Q1919171"
From MaRDI portal
The following pages link to \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171):
Displayed 7 items.
- A model for minimizing active processor time (Q487001) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)