Searching for "Competitive k-Server Algorithms." – sorted by Relevance.
9 documents found, showing 1 through 9.
-
Competitive k-Server Algorithms
- …Competitive k-Server Algorithms Amos Fiat ∗ Yuval Rabani ∗ Yiftach Ravid ∗ Abstract In this paper…
- Cited by 47 (4 self) – Add To MetaCart
-
The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms
- … competitive k-server algorithm into a distributed competitive one. As consequences we get poly(k)-competitive…
- Cited by 11 (3 self) – Add To MetaCart
-
A randomized on-line algorithm for the k-server problem on a line. Random Structures and Algorithms
- … of O(k) size. We present a O(n 2 3 log n)–competitive randomized k–server algorithm against…
- Cited by 3 (1 self) – Add To MetaCart
-
A Note on the Server Problem and a Benevolent Adversary
- …] proved that there are no c-competitive k-server algorithms for c ! k in any metric space with at least k…
- Cited by 1 (0 self) – Add To MetaCart
-
A General Decomposition Theorem for the k-Server Problem
- … to the randomized O(polylog(n))-competitive algorithms for MTS is a logical one to use for the k-server problem. We…
- Cited by 6 (0 self) – Add To MetaCart
-
Competitive Paging Algorithms
- … and 3 k = n \Gamma 1, and they conjectured that there exists a k-competitive k-server algorithm for any…
- Cited by 143 (21 self) – Add To MetaCart
-
On Page Migration and Other Relaxed Task Systems
- … \Gamma 1)-competitive k-server algorithm of [KP94] and the results of Section 2 give us a deterministic…
- Cited by 22 (4 self) – Add To MetaCart
-
Competitive Algorithms for Layered Graph Traversal
- … was used by [FRR] in their construction of competitive k-server algorithms. As an additional example…
- Cited by 21 (1 self) – Add To MetaCart
-
Competitive Algorithms for On-line Paging and Graph Coloring
- …, pages 86 100, 1973. 78 [23] E. Grove. The harmonic online k-server algorithm is competitive Proc…
- Add To MetaCart
Showing 1 through 9.
