Pages that link to "Item:Q528859"
From MaRDI portal
The following pages link to Scheduling partially ordered jobs faster than \(2^n\) (Q528859):
Displaying 5 items.
- Exact exponential algorithms for 3-machine flowshop scheduling problems (Q1743653) (← links)
- On the fine-grained parameterized complexity of partial scheduling to minimize the makespan (Q2161009) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
- (Q6089672) (← links)
