R–LINE: A Better Randomized 2-Server Algorithm on the Line [chapter]

Lucas Bang, Wolfgang Bein, Lawrence L. Larmore
2013 Lecture Notes in Computer Science  
A randomized on-line algorithm is given for the 2-server problem on the line, with competitiveness less than 1.901 against the oblivious adversary. This improves the previously best known competitiveness of 155 78 ≈ 1.987 for the problem. The algorithm uses a new approach and defines a potential in terms of isolation indices from T-theory.
doi:10.1007/978-3-642-38016-7_11 fatcat:mllli7t52fdrrnjwk3xfxady4i