An improved lower bound for rank four scheduling (Q1785250)
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: An improved lower bound for rank four scheduling |
scientific article; zbMATH DE number 6945277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved lower bound for rank four scheduling |
scientific article; zbMATH DE number 6945277 |
Statements
An improved lower bound for rank four scheduling (English)
0 references
28 September 2018
0 references
complexity
0 references
APX-hardness
0 references
scheduling
0 references
0 references
0.8962863683700562
0 references
0.8402804136276245
0 references
0.7716871500015259
0 references
0.7709595561027527
0 references
0.7605584859848022
0 references
