The 3-server problem in the plane.
DOI10.1016/S0304-3975(01)00305-XzbMATH Open1061.68180OpenAlexW2053265764MaRDI QIDQ1853532FDOQ1853532
Authors: Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore 
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00305-x
Recommendations
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)
Cites Work
- Title not available (Why is that?)
- The 2-evader problem
- On the \(k\)-server conjecture
- An Optimal On-Line Algorithm for K Servers on Trees
- Competitive algorithms for server problems
- On the k -server conjecture
- New Ressults on Server Problems
- Title not available (Why is that?)
- Page Migration Algorithms Using Work Functions
- Traversing Layered Graphs Using the Work Function Algorithm
Cited In (25)
- An application of various algorithms for solving the \(k\)-server problem
- A New Approach to the Server Problem
- Online \(k\)-server routing problems
- Generosity Helps or an 11-Competitive Algorithm for Three Servers
- Online chasing problems for regular polygons
- The online \(k\)-server problem with rejection
- Manhattan orbifolds
- Asymptotically optimal online page migration on three points
- On advice complexity of the \(k\)-server problem under sparse metrics
- Breaking the 2-competitiveness barrier for two servers in a tree
- A fast work function algorithm for solving the \(k\)-server problem
- The \(k\)-server problem
- Metrical service systems with multiple servers
- R-LINE: a better randomized 2-server algorithm on the line
- Deterministic 3-server on a circle and the limitation of canonical potentials
- A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle
- Online search for a hyperplane in high-dimensional Euclidean space
- A new upper bound on the work function algorithm for the \(k\)-server problem
- Online facility assignment
- On the competitive ratio of the work function algorithm for the \(k\)-server problem
- On the advice complexity of the \(k\)-server problem under sparse metrics
- The online \(k\)-server problem with max-distance objective
- A \(k\)-server problem with parallel requests and unit distances
- Online k-Server Routing Problems
- Competitive algorithms for the bicriteria \(k\)-server problem
This page was built for publication: The 3-server problem in the plane.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853532)
