Title of article :
A tight lower bound for the best-α algorithm
Author/Authors :
Eric Torng، نويسنده , , Patchrawat Uthaisombut، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1999
Pages :
6
From page :
17
To page :
22
Keywords :
Nonpreemptive scheduling , analysis of algorithms , Approximation algorithms
Journal title :
Information Processing Letters
Serial Year :
1999
Journal title :
Information Processing Letters
Record number :
129103
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129103
بازگشت