Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 (Q3521923)
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 5317232
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 |
scientific article; zbMATH DE number 5317232 |
Statements
Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2 (English)
0 references
28 August 2008
0 references
0.9617059230804444
0 references
0.8463452458381653
0 references
0.8426710367202759
0 references
0.8409870862960815
0 references
0.8407226800918579
0 references
