The k-server problem
From MaRDI portal
Publication:458484
DOI10.1016/J.COSREV.2009.04.002zbMATH Open1302.68329OpenAlexW2100311357MaRDI QIDQ458484FDOQ458484
Publication date: 7 October 2014
Published in: Computer Science Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cosrev.2009.04.002
Recommendations
- The \(k\)-client problem
- Fundamentals of Computation Theory
- The \(K\)-server problem via a modern optimization lens
- An application of various algorithms for solving the \(k\)-server problem
- On the bicriteria \(k\)-server problem
- On the k -server conjecture
- On the \(k\)-server conjecture
- A \(k\)-server problem with parallel requests and unit distances
- A general decomposition theorem for the \(k\)-server problem
- scientific article; zbMATH DE number 1875409
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Online algorithms; streaming algorithms (68W27) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Worst-case equilibria
- Title not available (Why is that?)
- Online algorithms. The state of the art
- On the power of randomization in on-line algorithms
- Title not available (Why is that?)
- Exploring an unknown graph
- A tight bound on approximating arbitrary metrics by tree metrics
- Random walks on weighted graphs and applications to on-line algorithms
- Self-adjusting binary search trees
- How to learn an unknown environment. I
- Shortest paths without a map
- Competitive snoopy caching
- Competitive randomized algorithms for nonuniform problems
- The 2-evader problem
- Competitive analysis of randomized paging algorithms
- On the \(k\)-server conjecture
- An Optimal On-Line Algorithm for K Servers on Trees
- Competitive algorithms for server problems
- Competitive paging algorithms
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- Title not available (Why is that?)
- An optimal on-line algorithm for metrical task system
- New algorithms for an ancient scheduling problem.
- HARMONIC is 3-competitive for two servers
- On the k -server conjecture
- Title not available (Why is that?)
- The harmonic k -server algorithm is competitive
- The 3-server problem in the plane.
- On the competitive ratio of the work function algorithm for the \(k\)-server problem
- New Ressults on Server Problems
- Beyond Competitive Analysis
- On metric Ramsey-type phenomena
- Generosity Helps or an 11-Competitive Algorithm for Three Servers
- A competitive 2-server algorithm
- Competitive \(k\)-server algorithms
- More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.
- The weighted 2-server problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On fast algorithms for two servers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Competitive Algorithms for Layered Graph Traversal
- Fairness in Scheduling
- Better Algorithms for Unfair Metrical Task Systems and Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear programming without the matrix
- On the value of information in distributed decision-making (extended abstract)
- A Primal-Dual Randomized Algorithm for Weighted Paging
Cited In (38)
- An analysis of service schedules for the mobile k-server problem
- Fundamentals of Computation Theory
- Reallocating multiple facilities on the line
- Any-order online interval selection
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
- Memoryless algorithms for the generalized k-server problem on uniform metrics
- Title not available (Why is that?)
- The online \(k\)-server problem with rejection
- An analysis of Klimov's problem with parallel servers
- Online \(k\)-taxi via double coverage and time-reverse primal-dual
- The (h, k)-Server Problem on Bounded Depth Trees
- Randomized online computation with high probability guarantees
- The \(k\)-resource problem in uniform metric spaces
- The CNN problem and other \(k\)-server variants
- A fast work function algorithm for solving the \(k\)-server problem
- A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem
- The multiple server location problem
- On the advice complexity of the \(k\)-server problem
- Stochastic dominance and the bijective ratio of online algorithms
- Metrical service systems with multiple servers
- The k-Server Problem with Delays on the Uniform Metric Space
- Trackless online algorithms for the server problem
- Multi-Finger Binary Search Trees
- Dynamic pricing of servers on trees
- Deterministic 3-server on a circle and the limitation of canonical potentials
- Online \(k\)-taxi via double coverage and time-reverse primal-dual
- Efficient algorithms for ride-hitching in UAV travelling
- A new upper bound on the work function algorithm for the \(k\)-server problem
- On the Advice Complexity of the k-Server Problem
- A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs
- On the competitive ratio of the work function algorithm for the \(k\)-server problem
- Online ride-hitching in UAV travelling
- The \(K\)-server problem via a modern optimization lens
- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
- Optimal online algorithms for the multi-objective time series search problem
- The online \(k\)-server problem with max-distance objective
- The traveling \(k\)-median problem: approximating optimal network coverage
- The median routing problem for simultaneous planning of emergency response and non-emergency jobs
This page was built for publication: The \(k\)-server problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458484)
