Scheduling partially ordered jobs faster than \(2^{n }\) (Q3092238)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5948017
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling partially ordered jobs faster than \(2^{n }\) |
scientific article; zbMATH DE number 5948017 |
Statements
Scheduling Partially Ordered Jobs Faster Than 2 n (English)
0 references
16 September 2011
0 references
moderately exponential algorithms
0 references
job scheduling
0 references
jobs with precedences
0 references
0.967896044254303
0 references
0.799997866153717
0 references
0.7975865602493286
0 references
0.7971823215484619
0 references
