Parameterized and approximation results for scheduling with a low rank processing time matrix (Q4636620)
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 6862114
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized and approximation results for scheduling with a low rank processing time matrix |
scientific article; zbMATH DE number 6862114 |
Statements
19 April 2018
0 references
APX-hardness
0 references
parameterized algorithm
0 references
scheduling
0 references
exponential time hypothesis
0 references
0.8816673755645752
0 references
0.8402804136276245
0 references
0.769507884979248
0 references
0.7678783535957336
0 references
0.7561467885971069
0 references
