A NEW APPROACH TO THE SERVER PROBLEM

被引:12
作者
CHROBAK, M
LARMORE, LL
机构
关键词
ALGORITHMS; OPTIMIZATION PROBLEMS; THE SERVER PROBLEM; COMPETITIVE ANALYSIS;
D O I
10.1137/0404029
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
A new method for dealing with the server problem is proposed. The technique consists of embedding the given metric space M into a bigger metric space cl(M) called the closure of M, and allowing our servers to move in cl(M). How this technique can be applied to give a new optimal algorithm for two servers is shown.
引用
收藏
页码:323 / 328
页数:6
相关论文
共 7 条
[1]  
BERMAN P, 1990, 1ST P ANN ACM SIAM S, P280
[2]   AN OPTIMAL ONLINE ALGORITHM FOR K-SERVERS ON TREES [J].
CHROBAK, M ;
LARMORE, LL .
SIAM JOURNAL ON COMPUTING, 1991, 20 (01) :144-148
[3]  
CHROBAK M, 1990, 1ST P ANN ACM SIAM S, P291
[4]  
COPPERSMITH D, 1990, 22ND P ANN ACM S THE, P369
[5]  
IRANI S, UNPUB COMPETITIVE 2
[6]  
MANASSE M, 1988, 20TH P ACM STOC, P322
[7]  
RAGHAVAN P, 1989, LECTURE NOTES COMPUT, V372, P687