Next Article in Journal
A PTAS For The k-Consensus Structures Problem Under Squared Euclidean Distance
Previous Article in Journal
Impact of Locality on Location Aware Unit Disk Graphs
Algorithms 2008, 1(1), 30-42; doi:10.3390/a1010030

Randomized Competitive Analysis for Two Server Problems

1,* , 2
1 Center for the Advanced Study of Algorithms, School of Computer Science, University of Nevada, Las Vegas, Nevada 89154, USA 2 School of Informatics, Kyoto University, Kyoto 606-8501, Japan
* Author to whom correspondence should be addressed.
Received: 13 August 2008 / Accepted: 18 September 2008 / Published: 19 September 2008
Download PDF [230 KB, uploaded 28 September 2008]


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).
Keywords: Randomized Algorithms; Online Algorithms; Server Problems Randomized Algorithms; Online Algorithms; Server Problems
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
MDPI and ACS Style

Bein, W.; Iwama, K.; Kawahara, J. Randomized Competitive Analysis for Two Server Problems. Algorithms 2008, 1, 30-42.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here


[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert