Steve Seiden. A general decomposition theorem for the k-server problem. Information and Computation, 174(2):193--202, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Ramsey-type Theorem for Metric Spaces and its.. - Bartal.. (2001) (1 citation) (Correct)
.... following major advancements in the analysis of the upper bounds for MTS, appearing in [Bar96, Bar98, BBBT97, FM00] The best current upper bound for MTS is O(log n log log n) Currently there is no general randomized upper bound for the K server problem better than 2K 1 [KP95] Seiden [Sei01] has a promising result in this direction, showing sub linear bounds for certain spaces with certain number of servers. In this paper we give lower bounds that get closer to the conjectured bounds: we prove that, in any metric space, ace n= log log n) is a lower bound for MTS and d 3 K= ....
Steve Seiden, A general decomposition theorem for the k-server problem, Proceedings of the 9th Annual European Symposium on Algorithms, 2001, To appear.
Randomized k-Server Algorithms for Growth-Rate Bounded Graphs.. - Yair Cs Huji (2003) (Correct)
No context found.
Steve Seiden. A general decomposition theorem for the k-server problem. Information and Computation, 174(2):193--202, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC