A greedy approximation algorithm for minimum-gap scheduling (Q4924641)
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: A greedy approximation algorithm for minimum-gap scheduling |
scientific article; zbMATH DE number 6171998
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy approximation algorithm for minimum-gap scheduling |
scientific article; zbMATH DE number 6171998 |
Statements
A Greedy Approximation Algorithm for Minimum-Gap Scheduling (English)
0 references
7 June 2013
0 references
0.9921620488166808
0 references
0.8669606447219849
0 references
0.8499658703804016
0 references
0.807381272315979
0 references
0.79625403881073
0 references
