暂无分享,去创建一个
[1] Piotr Indyk,et al. On page migration and other relaxed task systems , 1997, SODA '97.
[2] Mihalis Yannakakis,et al. Shortest Paths Without a Map , 1989, Theor. Comput. Sci..
[3] Sandy Irani,et al. Randomized Algorithms for Metrical Task Systems , 1995, Theor. Comput. Sci..
[4] Steven S. Seiden,et al. Unfair Problems and Randomized Algorithms for Metrical Task Systems , 1999, Inf. Comput..
[5] Yair Bartal,et al. Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[6] William R. Burley,et al. Traversing Layered Graphs Using the Work Function Algorithm , 1996, J. Algorithms.
[7] Amos Fiat,et al. Competitive Paging Algorithms , 1991, J. Algorithms.
[8] Nathan Linial,et al. On metric Ramsey-type phenomena , 2004 .
[9] Lyle A. McGeoch,et al. Competitive Algorithms for Server Problems , 1990, J. Algorithms.
[10] Peter L. Bartlett,et al. A Regularization Approach to Metrical Task Systems , 2010, ALT.
[11] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.
[12] Sandy Irani,et al. On Algorithm Design for Metrical Task Systems , 1995, SODA '95.
[13] Béla Bollobás,et al. A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[14] Sundar Vishwanathan,et al. Metrical Service Systems with Multiple Servers , 2012, Algorithmica.
[15] Joseph Naor,et al. Metrical Task Systems and the k-Server Problem on HSTs , 2010, ICALP.
[16] Yuval Rabani,et al. Lower bounds for randomized k-server and motion-planning algorithms , 1991, STOC '91.
[17] Yuval Rabani,et al. A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems , 2000, SIAM J. Comput..
[18] John Augustine,et al. Optimal power-down strategies , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[19] Nathan Linial,et al. On convex body chasing , 1993, Discret. Comput. Geom..
[20] Avrim Blum,et al. On-line Learning and the Metrical Task System Problem , 1997, COLT '97.
[21] Ricardo A. Baeza-Yates,et al. Searching in the Plane , 1993, Inf. Comput..
[22] Andrew Tomkins,et al. A polylog(n)-competitive algorithm for metrical task systems , 1997, STOC '97.
[23] H. Ramesh,et al. On traversing layered graphs on-line , 1993, SODA '93.
[24] Lawrence L. Larmore,et al. Metrical Service Systems: Deterministic Strategies , 1993 .
[25] Esteban Feuerstein. Uniform Service Systems with k Servers , 1998, LATIN.
[26] Sandy Irani,et al. Online strategies for dynamic power management in systems with multiple power-saving states , 2003, TECS.
[27] Amos Fiat,et al. Better algorithms for unfair metrical task systems and applications , 2000, STOC '00.
[28] Allan Borodin,et al. An optimal on-line algorithm for metrical task system , 1992, JACM.
[29] Sundar Vishwanathan,et al. Competitive Algorithms for Layered Graph Traversal , 1998, SIAM J. Comput..
[30] James R. Lee,et al. Metrical task systems on trees via mirror descent and unfair gluing , 2018, SODA.
[31] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.