Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming (Q5245846)
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: Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming |
scientific article; zbMATH DE number 6425350
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming |
scientific article; zbMATH DE number 6425350 |
Statements
Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming (English)
0 references
15 April 2015
0 references
competitive analysis
0 references
online scheduling
0 references
dynamic programming
0 references
