Abstract
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 \(\frac{155}{78}\approx 1.987\) for the problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bandelt, H.-J., Dress, A.: A canonical decomposition theory for metrics on a finite set. Adv. Math. 92, 47–105 (1992)
Bansal, N., Buchbinder, N., Madry, A., Naor, J.: A polylogarithmic-competitive algorithm for the k-server problem. In: Proc. 52nd Symp. Foundations of Computer Science (FOCS), 10 pages. IEEE Computer Society (2011)
Barron, E.N.: Game Theory: An Introduction. John Wiley & Sons, New Jersey (2008)
Bartal, Y., Bollobás, B., Mendel, M.: A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems. In: Proc. 42nd Symp. Foundations of Computer Science (FOCS), pp. 396–405. IEEE (2001)
Bartal, Y., Chrobak, M., Larmore, L.L.: A randomized algorithm for two servers on the line (Extended Abstract). In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 247–258. Springer, Heidelberg (1998)
Bein, W., Chrobak, M., Larmore, L.L.: The 3-server problem in the plane. Theoret. Comput. Sci. 287, 387–391 (2002)
Bein, W., Iwama, K., Kawahara, J.: Randomized competitive analysis for two-server problems. Algorithms 1, 30–42 (2008)
Bein, W., Iwama, K., Kawahara, J., Larmore, L.L., Oravec, J.A.: A randomized algorithm for two servers in cross polytope spaces. Theoretical Computer Science 412(2), 563–572 (2011)
Bein, W., Larmore, L., Noga, J., Reischuk, R.: Knowledge state algorithms. Algorithmica 60(3), 653–678 (2011)
Chrobak, M., Larmore, L.L.: An optimal online algorithm for k servers on trees. SIAM J. Comput. 20, 144–148 (1991)
Chrobak, M., Larmore, L.L., Lund, C., Reingold, N.: A better lower bound on the competitive ratio of the randomized 2-server problem. Inform. Process. Lett. 63, 79–83 (1997)
Koutsoupias, E., Papadimitriou, C.: Beyond competitive analysis. In: Proc. 35th Symp. Foundations of Computer Science (FOCS), pp. 394–400. IEEE (1994)
Manasse, M., McGeoch, L.A., Sleator, D.: Competitive algorithms for server problems. J. Algorithms 11, 208–230 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bang, L., Bein, W., Larmore, L.L. (2013). R–LINE: A Better Randomized 2-Server Algorithm on the Line. In: Erlebach, T., Persiano, G. (eds) Approximation and Online Algorithms. WAOA 2012. Lecture Notes in Computer Science, vol 7846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38016-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-38016-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38015-0
Online ISBN: 978-3-642-38016-7
eBook Packages: Computer ScienceComputer Science (R0)