Towards Tight Lower Bounds for Scheduling Problems (Q3452775): Difference between revisions
From MaRDI portal
Latest revision as of 02:13, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Towards Tight Lower Bounds for Scheduling Problems |
scientific article |
Statements
Towards Tight Lower Bounds for Scheduling Problems (English)
0 references
19 November 2015
0 references
hardness of approximation
0 references
scheduling problems
0 references
unique games conjecture
0 references
0 references
0 references