Scheduling partially ordered jobs faster than \(2^n\) (Q528859)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Scheduling partially ordered jobs faster than \(2^n\) |
scientific article; zbMATH DE number 6718310
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling partially ordered jobs faster than \(2^n\) |
scientific article; zbMATH DE number 6718310 |
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
0.9994452
0 references
0.8998883
0 references
0 references
0.8682642
0 references
0.86569273
0 references
0.8636171
0 references
0.8626304
0 references
0.86041915
0 references
