Publisher
Springer Science and Business Media LLC
Reference28 articles.
1. Albers S (2004) New results on web caching with request reordering. In: Proceedings of the 16th ACM symposium on parallel algorithms and architectures (SPAA), pp 84–92
2. Alborzi H, Torng E, Uthaisombut P, Wagner S (2001) The k-client problem. J Algorithms 41(2):115–173
3. Asahiro Y, Kawahara K, Miyano E (2010) NP-hardness of the sorting buffer problem on the uniform metric. Unpublished manuscript
4. Aspnes J, Azar Y, Fiat A, Plotkin SA, Waarts O (1997) On-line routing of virtual circuits with applications to load balancing and machine scheduling. J ACM 44(3):486–504
5. Avigdor-Elgrabli N, Rabani Y (2010) An improved competitive algorithm for reordering buffer management. In: Proceedings of the 21st ACM-SIAM symposium on discrete algorithms (SODA), pp. 13–21
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献