Randomized Competitive Analysis for Two Server Problems
AbstractWe 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). View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Bein, W.; Iwama, K.; Kawahara, J. Randomized Competitive Analysis for Two Server Problems. Algorithms 2008, 1, 30-42.
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.