The k-server problem
From MaRDI portal
Publication:458484
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
Cites work
- scientific article; zbMATH DE number 432775 (Why is no real title available?)
- scientific article; zbMATH DE number 5485534 (Why is no real title available?)
- scientific article; zbMATH DE number 4049014 (Why is no real title available?)
- scientific article; zbMATH DE number 4062645 (Why is no real title available?)
- scientific article; zbMATH DE number 65694 (Why is no real title available?)
- scientific article; zbMATH DE number 65695 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1256655 (Why is no real title available?)
- scientific article; zbMATH DE number 2038743 (Why is no real title available?)
- scientific article; zbMATH DE number 1500545 (Why is no real title available?)
- scientific article; zbMATH DE number 1559590 (Why is no real title available?)
- scientific article; zbMATH DE number 1559591 (Why is no real title available?)
- scientific article; zbMATH DE number 1775400 (Why is no real title available?)
- scientific article; zbMATH DE number 2102754 (Why is no real title available?)
- A competitive 2-server algorithm
- A primal-dual randomized algorithm for weighted paging
- A tight bound on approximating arbitrary metrics by tree metrics
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- An Optimal On-Line Algorithm for K Servers on Trees
- An optimal on-line algorithm for metrical task system
- Better Algorithms for Unfair Metrical Task Systems and Applications
- Beyond Competitive Analysis
- Competitive Algorithms for Layered Graph Traversal
- Competitive \(k\)-server algorithms
- Competitive algorithms for server problems
- Competitive analysis of randomized paging algorithms
- Competitive paging algorithms
- Competitive randomized algorithms for nonuniform problems
- Competitive snoopy caching
- Exploring an unknown graph
- Fairness in Scheduling
- Generosity Helps or an 11-Competitive Algorithm for Three Servers
- HARMONIC is 3-competitive for two servers
- How to learn an unknown environment. I
- Linear programming without the matrix
- More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.
- New Ressults on Server Problems
- New algorithms for an ancient scheduling problem.
- On fast algorithms for two servers
- On the k -server conjecture
- On the \(k\)-server conjecture
- On the competitive ratio of the work function algorithm for the \(k\)-server problem
- On the power of randomization in on-line algorithms
- On the value of information in distributed decision-making (extended abstract)
- Online algorithms. The state of the art
- Random walks on weighted graphs and applications to on-line algorithms
- Self-adjusting binary search trees
- Shortest paths without a map
- The 2-evader problem
- The 3-server problem in the plane.
- The harmonic k -server algorithm is competitive
- The weighted 2-server problem
- Worst-case equilibria
Cited in
(37)- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
- On the advice complexity of the \(k\)-server problem
- A new upper bound on the work function algorithm for the \(k\)-server problem
- On the competitive ratio of the work function algorithm for the \(k\)-server problem
- Metrical service systems with multiple servers
- Online ride-hitching in UAV travelling
- The median routing problem for simultaneous planning of emergency response and non-emergency jobs
- The \(K\)-server problem via a modern optimization lens
- The k-Server Problem with Delays on the Uniform Metric Space
- Dynamic pricing of servers on trees
- Memoryless algorithms for the generalized k-server problem on uniform metrics
- The traveling \(k\)-median problem: approximating optimal network coverage
- scientific article; zbMATH DE number 7204578 (Why is no real title available?)
- Multi-Finger Binary Search Trees
- Online \(k\)-taxi via double coverage and time-reverse primal-dual
- Randomized online computation with high probability guarantees
- An analysis of Klimov's problem with parallel servers
- Any-order online interval selection
- A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs
- Stochastic dominance and the bijective ratio of online algorithms
- 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
- An analysis of service schedules for the mobile k-server problem
- The \(k\)-resource problem in uniform metric spaces
- The CNN problem and other \(k\)-server variants
- The online \(k\)-server problem with rejection
- The multiple server location problem
- Fundamentals of Computation Theory
- Trackless online algorithms for the server problem
- Reallocating multiple facilities on the line
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
- Deterministic 3-server on a circle and the limitation of canonical potentials
- The online \(k\)-server problem with max-distance objective
- Efficient algorithms for ride-hitching in UAV travelling
- Online \(k\)-taxi via double coverage and time-reverse primal-dual
- On the advice complexity of the \(k\)-server problem
- The (h, k)-Server Problem on Bounded Depth Trees
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)
