Closing the gap for makespan scheduling via sparsification techniques (Q3387928)
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: Closing the gap for makespan scheduling via sparsification techniques |
scientific article; zbMATH DE number 7291320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Closing the gap for makespan scheduling via sparsification techniques |
scientific article; zbMATH DE number 7291320 |
Statements
Closing the Gap for Makespan Scheduling via Sparsification Techniques (English)
0 references
8 January 2021
0 references
scheduling
0 references
approximation algorithms
0 references
polynomial time approximation scheme
0 references
makespan
0 references
conditional lower bounds
0 references
0.8178464770317078
0 references
0.8019304871559143
0 references
0.7841192483901978
0 references
0.7670999765396118
0 references
