Online computation and competitive analysis
Online computation and competitive analysis
On the Advice Complexity of Online Problems
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
How much information about the future is needed?
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Information complexity of online problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Advice complexity and barely random algorithms
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Online computation with advice
Theoretical Computer Science
On the advice complexity of the k-server problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
| Hi-index | 0.00 |
We consider the model of online computation with advice [5]. In particular, we study the k-server problem under this model. We prove two upper bounds for this problem. First, we show a ⌈{⌈log k⌉}/{b-2}⌉-competitive online algorithm for general metric spaces with b bits of advice per request, where 3≤b≤logk. This improves upon the recent result of [1]. Moreover, we believe that our algorithm and our analysis are more intuitive and simpler than those of [1]. Second, we give a 1-competitive online algorithm for trees which uses 2+2⌈log(p+1)⌉ bits of advice per request, where p is the caterpillar dimension of the tree.