Algorithms 2008, 1(1), 30-42; doi:10.3390/a1010030

Randomized Competitive Analysis for Two Server Problems

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
PDF Full-text Download PDF Full-Text [230 KB, uploaded 28 September 2008 00:36 CEST]
Abstract: 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

Article Statistics

Load and display the download statistics.

Citations to this Article

Cite This Article

MDPI and ACS Style

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

AMA Style

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

Chicago/Turabian Style

Bein, Wolfgang; Iwama, Kazuo; Kawahara, Jun. 2008. "Randomized Competitive Analysis for Two Server Problems." Algorithms 1, no. 1: 30-42.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert