论文信息 - Randomized Competitive Analysis for Two Server Problems

Randomized Competitive Analysis for Two Server Problems

We prove that there exists a randomized online algorithm for the 2-server 3-point problem whose expected competitive ratio is at most 1.5897. This is the first nontrivial upper bound for randomized k-server algorithms in a general metric space whose competitive ratio is well below the corresponding deterministic lower bound (= 2 in the 2-server case).

[1] K. Appel,et al. Every planar map is four colorable. Part I: Discharging , 1977 .

[2] Marek Chrobak,et al. An Optimal On-Line Algorithm for k-Servers on Trees , 1991, SIAM J. Comput..

[3] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[4] Amos Fiat,et al. Competitive Paging Algorithms , 1991, J. Algorithms.

[5] Luca Trevisan,et al. Gadgets, Approximation, and Linear Programming , 2000, SIAM J. Comput..

[6] Lyle A. McGeoch,et al. Competitive Algorithms for Server Problems , 1990, J. Algorithms.

[7] Christos H. Papadimitriou,et al. On the k-server conjecture , 1995, JACM.

[8] Prabhakar Raghavan,et al. Random walks on weighted graphs and applications to on-line algorithms , 1993, JACM.

[9] Marek Chrobak,et al. New results on server problems , 1991, SODA '90.

[10] Steven S. Seiden,et al. On the online bin packing problem , 2001, JACM.

[11] Marek Chrobak,et al. A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem , 1997, Inf. Process. Lett..

[12] Jeffery R. Westbrook,et al. Randomized competitive algorithms for the list update problem , 1991, SODA '91.

[13] Marek Chrobak,et al. A Randomized Algorithm for Two Servers on the Line (Extended Abstract) , 1998, ESA.

[14] Anna R. Karlin,et al. Competitive randomized algorithms for non-uniform problems , 1990, SODA '90.