Tighter approximation bounds for LPT scheduling in two special cases (Q1026246)
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: Tighter approximation bounds for LPT scheduling in two special cases |
scientific article; zbMATH DE number 5569528
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tighter approximation bounds for LPT scheduling in two special cases |
scientific article; zbMATH DE number 5569528 |
Statements
Tighter approximation bounds for LPT scheduling in two special cases (English)
0 references
24 June 2009
0 references
approximation algorithms
0 references
related machine scheduling
0 references
LPT
0 references
scheduling mechanisms
0 references
monotone algorithms
0 references
0 references
0 references
1.0000001
0 references
0.93986523
0 references
0 references
0.89542717
0 references
0.89117473
0 references
0.88561976
0 references
0.88552004
0 references
0.8822981
0 references
