Bounding the Running Time of Algorithms for Scheduling and Packing Problems (Q5891115)
From MaRDI portal
scientific article; zbMATH DE number 6197963
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounding the Running Time of Algorithms for Scheduling and Packing Problems |
scientific article; zbMATH DE number 6197963 |
Statements
Bounding the Running Time of Algorithms for Scheduling and Packing Problems (English)
0 references
12 August 2013
0 references
scheduling
0 references
packing
0 references
exponential time hypothesis
0 references
exact algorithms
0 references
lower bounds
0 references
