Bounding the running time of algorithms for scheduling and packing problems (Q5890508)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6549693
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the running time of algorithms for scheduling and packing problems |
scientific article; zbMATH DE number 6549693 |
Statements
4 March 2016
0 references
scheduling
0 references
packing
0 references
exponential time hypothesis
0 references
exact algorithms
0 references
lower bounds
0 references
0 references
Bounding the running time of algorithms for scheduling and packing problems (English)
0 references
0.9728155732154846
0 references
0.8126402497291565
0 references
0.803277313709259
0 references
0.782960057258606
0 references
0.7824681401252747
0 references
