R–LINE: A better randomized 2-server algorithm on the line

Lucas Bang, Wolfgang Bein, Lawrence L. Larmore
2015 Theoretical 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.1016/j.tcs.2015.08.043 fatcat:uyn2nh2id5cevdin5sqlugrpou