# A randomized algorithm for two servers in cross polytope spaces

@article{Bein2011ARA, title={A randomized algorithm for two servers in cross polytope spaces}, author={Wolfgang W. Bein and Kazuo Iwama and Jun Kawahara and Lawrence L. Larmore and James A. Oravec}, journal={Theor. Comput. Sci.}, year={2011}, volume={412}, pages={563-572} }

- Published in Theor. Comput. Sci. 2011
DOI:10.1016/j.tcs.2010.08.022

It has been a long-standing open problem to determine the exact randomized competitiveness of the 2-server problem, that is, the minimum competitiveness of any randomized online algorithm for the 2-server problem. For deterministic algorithms the best competitive ratio that can be obtained is 2 and no randomized algorithm is known that improves this ratio for general spaces. For the line, Bartal et al. (1998) [2] give a 15578 competitive algorithm, but their algorithm is specific to the… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 14 REFERENCES

## Online computation and competitive analysis

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## A Randomized Algorithm for Two Servers on the Line

VIEW 2 EXCERPTS

## Larmore . A randomized algorithm for two servers on the line

## On the k-Server Conjecture

VIEW 2 EXCERPTS

## Beyond Competitive Analysis

VIEW 1 EXCERPT

## Linear Programs for Randomized On-Line Algorithms

VIEW 2 EXCERPTS