On the optimality of exact and approximation algorithms for scheduling problems (Q1635503)
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: On the optimality of exact and approximation algorithms for scheduling problems |
scientific article; zbMATH DE number 6881613
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the optimality of exact and approximation algorithms for scheduling problems |
scientific article; zbMATH DE number 6881613 |
Statements
On the optimality of exact and approximation algorithms for scheduling problems (English)
0 references
6 June 2018
0 references
approximation schemes
0 references
scheduling
0 references
lower bounds
0 references
exponential time hypothesis
0 references
