Memoryless algorithms for the generalized k-server problem on uniform metrics
From MaRDI portal
Publication:2117695
DOI10.1007/978-3-030-80879-2_10OpenAlexW3186049970MaRDI QIDQ2117695
Dimitris Fotakis, Grigorios Koumoutsos, Dimitris Christou
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2007.08669
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(k\)-server problem
- A strongly competitive randomized paging algorithm
- On the power of randomization in on-line algorithms
- Competitive algorithms for the weighted server problem
- Competitive analysis of randomized paging algorithms
- The weighted 2-server problem
- The CNN problem and other \(k\)-server variants
- Random walks on weighted graphs and applications to on-line algorithms
- A Polylogarithmic-Competitive Algorithm for the k -Server Problem
- Randomized Memoryless Algorithms for the Weighted and the Generalized k -server Problems
- Competitive algorithms for server problems
- The generalized two-server problem
- On the k -server conjecture
- k-server via multiscale entropic regularization
- k-Servers with a Smile: Online Algorithms via Projections
- The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
- The harmonic k -server algorithm is competitive