Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. H. Alborzi, E. Torng, P. Uthaisombut, and S. Wagner. The k-client problem. In Proc. of Eigth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1995.
2. G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo. Competitive algorithms for the traveling salesman. In Proc. of Workshop on Algorithms and Data Structures (WADS'95), Springer-Verlag, 1995.
3. G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo. Serving requests with on-line routing. In Proc. of 4th Scandinavian Workshop on Algorithm Theory (SWAT'94), pages 37–48, Springer-Verlag, July 1995.
4. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Widgerson. On the power of randomization in on-line algorithms. Algorithmica, 11:2–14, 1994.
5. A. Borodin, Sandy Irani, P. Raghavan, and B. Schieber. Competitive paging with locality of reference. In Proc. of 23rd ACM Symposium on Theory of Computing, pages 249–259, 1991.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献