Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming (Q5245846): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:09, 8 February 2024
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
