The 3-server problem in the plane

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1643, Issue , 1999, Pages 301-312

  Bein, Wolfgang W ^a   Chrobak, Marek ^b   Larmore, Lawrence L ^a  

^a University of Nevada Las Vegas   (United States)

^b University of California Riverside   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; SET THEORY; TOPOLOGY;

COMPETITIVE ALGORITHMS; COMPETITIVE RATIO; EUCLIDEAN PLANES; METRIC SPACES; ON-LINE ALGORITHMS; ON-LINE FASHION; SERVER PROBLEM; WORK FUNCTION ALGORITHMS;

ALGORITHMS;

EID: 84958048172     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_27     Document Type: Conference Paper

References (8)

1. Marek Chrobak, Howard Karloff, Tom H. Payne, and Sundar Vishwanathan. New results on server problems. SIAM Journal on Discrete Mathematics, 4:172-181, 1991.
2. Marek Chrobak and Lawrence L. Larmore. An optimal online algorithm for k servers on trees. SIAM Journal on Computing, 20:144-148, 1991.
3. Marek Chrobak and Lawrence L. Larmore. The server problem and online games. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 7, pages 11-64, 1992.
4. Marek Chrobak and Lawrence L. Larmore. Metrical task systems, the server problem, and the work function algorithm. In Online Algorithms: State of the Art, pages 74-94. Springer-Verlag, 1998.
5. Elias Koutsoupias and Christos Papadimitriou. On the k-server conjecture. In Proc. 26th Symp. Theory of Computing, pages 507-511, 1994.
6. Elias Koutsoupias and Christos Papadimitriou. On the k-server conjecture. Journal of the ACM, 42:971-983, 1995.
7. Elias Koutsoupias and Christos Papadimitriou. The 2-evader problem. Information Processing Letters, 57:249-252, 1996.
8. Mark Manasse, Lyle A. McGeoch, and Daniel Sleator. Competitive algorithms for server problems. Journal of Algorithms, 11:208-230, 1990.