R-LINE: a better randomized 2-server algorithm on the line
From MaRDI portal
Publication:888438
DOI10.1016/j.tcs.2015.08.043zbMath1330.68349OpenAlexW2179938063MaRDI QIDQ888438
Lucas Bang, Lawrence L. Larmore, Wolfgang W. Bein
Publication date: 30 October 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.043
Applications of game theory (91A80) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A better lower bound on the competitive ratio of the randomized 2-server problem
- Knowledge state algorithms
- A randomized algorithm for two servers in cross polytope spaces
- Randomized algorithm for the \(k\)-server problem on decomposable spaces
- A canonical decomposition theory for metrics on a finite set
- The coherency index
- Randomized competitive analysis for two server problems
- The 3-server problem in the plane.
- A randomized algorithm for two servers on the line.
- Classification of six-point metrics
- \(T\)-theory: An overview
- Ramsey-type theorems for metric spaces with applications to online problems
- Six theorems about injective metric spaces
- Random walks on weighted graphs and applications to on-line algorithms
- An Optimal On-Line Algorithm for K Servers on Trees
- New Ressults on Server Problems
- Competitive algorithms for server problems
- On fast algorithms for two servers
- Beyond Competitive Analysis
- A Primal-Dual Randomized Algorithm for Weighted Paging
- Optimal online buffer scheduling for block devices
- Game Theory
- A randomized on–line algorithm for the k–server problem on a line
- A Polylogarithmic-Competitive Algorithm for the k-Server Problem
This page was built for publication: R-LINE: a better randomized 2-server algorithm on the line
