Scheduling partially ordered jobs faster than \(2^n\) (Q528859)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling partially ordered jobs faster than \(2^n\) |
scientific article |
Statements
Scheduling partially ordered jobs faster than \(2^n\) (English)
0 references
17 May 2017
0 references
moderately-exponential algorithms
0 references
dynamic programming
0 references
\(2^n\)-barrier
0 references
scheduling
0 references
partially ordered jobs
0 references
0 references
0 references
0 references
