Sciweavers

STOC
2002
ACM
121views Algorithms» more  STOC 2002»
15 years 26 days ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat