Randomized Competitive Analysis for Two-Server Problems

Authors:
Wolfgang Bein;Kazuo Iwama;Jun Kawahara
Affiliations:
Center for the Advanced Study of Algorithms, School of Computer Science, University of Nevada, Las Vegas, Nevada, USA 89154;School of Informatics, Kyoto University, Kyoto, Japan 606-8501;School of Informatics, Kyoto University, Kyoto, Japan 606-8501
Venue:
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Year:
2008

Citing 20
Cited 1

Competitive algorithms for server problems

Journal of Algorithms
An optimal on-line algorithm for K-servers on trees

SIAM Journal on Computing
New results on server problems

SIAM Journal on Discrete Mathematics
Competitive paging algorithms

Journal of Algorithms
On the k-server conjecture

Journal of the ACM (JACM)
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
A better lower bound on the competitive ratio of the randomized 2-server problem

Information Processing Letters
Linear programs for randomized on-line algorithms

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Gadgets, Approximation, and Linear Programming

SIAM Journal on Computing
Dynamic TCP acknowledgement and other stories about e/(e-1)

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the online bin packing problem

Journal of the ACM (JACM)
A Randomized Algorithm for Two Servers on the Line (Extended Abstract)

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
The 3-Server Problem in the Plane

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A 7/8-Approximation Algorithm for MAX 3SAT?

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A Ramsey-Type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Beyond competitive analysis [on-line algorithms]

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Equitable revisited

ESA'07 Proceedings of the 15th annual European conference on Algorithms
A randomized algorithm for two servers in cross polytope spaces

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Finite-State online algorithms and their automated competitive analysis

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

A Comparison of Performance Measures for Online Algorithms

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that there exits 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).