The \(k\)-resource problem in uniform metric spaces
From MaRDI portal
Publication:1758162
DOI10.1016/j.tcs.2012.06.026zbMath1250.68287OpenAlexW2053648879MaRDI QIDQ1758162
Marcin Bienkowski, Jarosław Kutyłowski
Publication date: 8 November 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.026
Analysis of algorithms (68W40) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(k\)-server problem
- A strongly competitive randomized paging algorithm
- The 2-evader problem
- Competitive analysis of randomized paging algorithms
- On metric Ramsey-type phenomena
- An Optimal On-Line Algorithm for K Servers on Trees
- New Ressults on Server Problems
- Competitive algorithms for server problems
- Metrical Task Systems and the k-Server Problem on HSTs
- Competitive paging algorithms
- On the k -server conjecture
- A Primal-Dual Randomized Algorithm for Weighted Paging