A general decomposition theorem for the \(k\)-server problem
From MaRDI portal
Publication:1854527
DOI10.1006/inco.2002.3144zbMath1009.68005OpenAlexW2013255427MaRDI QIDQ1854527
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.2002.3144
Network design and communication in computer systems (68M10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Related Items
Ramsey-type theorems for metric spaces with applications to online problems ⋮ Randomized algorithm for the \(k\)-server problem on decomposable spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A better lower bound on the competitive ratio of the randomized 2-server problem
- A strongly competitive randomized paging algorithm
- Online algorithms. The state of the art
- Unfair problems and randomized algorithms for metrical task systems
- On the power of randomization in on-line algorithms
- Competitive randomized algorithms for nonuniform problems
- Randomized weighted caching with two page weights
- The 2-evader problem
- A randomized algorithm for two servers on the line.
- A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems
- Better algorithms for unfair metrical task systems and applications
- An Optimal On-Line Algorithm for K Servers on Trees
- New Ressults on Server Problems
- Competitive algorithms for server problems
- Competitive paging algorithms
- Lower Bounds for Randomized k-Server and Motion-Planning Algorithms
- An optimal on-line algorithm for metrical task system
- On the k -server conjecture
