|
Volumn , Issue , 1996, Pages 550-559
|
New algorithms for the disk scheduling problem
|
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATION ALGORITHM;
DISK SCHEDULING PROBLEMS;
TRAVELING SALESMAN PROBLEM;
ALGORITHMS;
APPROXIMATION THEORY;
MAGNETIC DISK STORAGE;
OPTIMIZATION;
POLYNOMIALS;
PROBLEM SOLVING;
STORAGE ALLOCATION (COMPUTER);
|
EID: 0030403755
PISSN: 02725428
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (31)
|
References (24)
|