ON EXPLORERS , CHASERS AND CAMERAMEN
暂无分享,去创建一个
[1] Christos H. Papadimitriou,et al. The 2-Evader Problem , 1996, Inf. Process. Lett..
[2] Lyle A. McGeoch,et al. Competitive algorithms for on-line problems , 1988, STOC '88.
[3] David Scot Taylor,et al. The CNN problem and other k-server variants , 2000, Theor. Comput. Sci..
[4] Allan Borodin,et al. An optimal online algorithm for metrical task systems , 1987, STOC.
[5] Mihalis Yannakakis,et al. Shortest Paths Without a Map , 1989, Theor. Comput. Sci..
[6] Christos H. Papadimitriou,et al. On the k-server conjecture , 1995, JACM.
[7] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[8] Marek Chrobak,et al. A New Approach to the Server Problem , 1991, SIAM J. Discret. Math..
[9] Lawrence L. Larmore,et al. Metrical Service Systems: Deterministic Strategies , 1993 .
[10] Ricardo A. Baeza-Yates,et al. Searching in the Plane , 1993, Inf. Comput..
[11] Allan Borodin,et al. An optimal on-line algorithm for metrical task system , 1992, JACM.
[12] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[13] Leen Stougie,et al. A Competitive Algorithm for the General 2-Server Problem , 2003, ICALP.
[14] Yuval Rabani,et al. Competitive algorithms for layered graph traversal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[15] Nathan Linial,et al. On convex body chasing , 1993, Discret. Comput. Geom..
[16] William R. Burley,et al. Traversing Layered Graphs Using the Work Function Algorithm , 1996, J. Algorithms.
[17] Lyle A. McGeoch,et al. Competitive Algorithms for Server Problems , 1990, J. Algorithms.