An Optimal On-Line Algorithm for K Servers on Trees

Recommendations

The fast algorithm for online \(k\)-server problem on trees
A randomized on–line algorithm for the k–server problem on a line
On online algorithms with advice for the k-server problem
On online algorithms with advice for the \(k\)-server problem
A fast implementation of the optimal off-line algorithm for solving the k-server problem
The (h,k)-server problem on bounded depth trees
The (h, k)-Server Problem on Bounded Depth Trees
scientific article; zbMATH DE number 1559551
An online algorithm for the dynamic maximal dense tree problem
The online \(k\)-server problem with max-distance objective

Cited in

(61)

A note on the server problem and a benevolent adversary
On-line algorithms for locating checkpoints
Competitive randomized algorithms for nonuniform problems
A deterministic O(k^ 3)-competitive k-server algorithm for the circle
Competitive k-server algorithms
The list update problem and the retrieval of sets
Competitive algorithms for the weighted server problem
The 2-evader problem
More on randomized on-line algorithms for caching.
Competitive analysis of randomized paging algorithms
Trackless online algorithms for the server problem
Randomized competitive analysis for two server problems
A primal-dual online algorithm for the k-server problem on weighted HSTs
Tight bounds for double coverage against weak adversaries
The \(k\)-resource problem in uniform metric spaces
The 3-server problem in the plane.
A randomized algorithm for two servers on the line.
A general decomposition theorem for the k-server problem
The weighted 2-server problem
On the competitive ratio of the work function algorithm for the k-server problem
The CNN problem and other k-server variants
The fast algorithm for online \(k\)-server problem on trees
Metrical service systems with multiple servers
Stochastic dominance and the bijective ratio of online algorithms
The online \(k\)-server problem with max-distance objective
Competitive algorithms for the bicriteria \(k\)-server problem
A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
On advice complexity of the k-server problem under sparse metrics
A better lower bound on the competitive ratio of the randomized 2-server problem
New Ressults on Server Problems
Randomized Competitive Analysis for Two-Server Problems
scientific article; zbMATH DE number 65696 (Why is no real title available?)
The (h, k)-Server Problem on Bounded Depth Trees
The \(k\)-server problem
On the advice complexity of the \(k\)-server problem under sparse metrics
Multi-Finger Binary Search Trees
\(k\)-servers with a smile: online algorithms via projections
A Randomized Algorithm for Two Servers in Cross Polytope Spaces
ON THE k-TRUCK SCHEDULING PROBLEM
scientific article; zbMATH DE number 7651167 (Why is no real title available?)
Dynamic pricing of servers on trees
Online \(k\)-taxi via double coverage and time-reverse primal-dual
Online facility assignment
Online \(k\)-taxi via double coverage and time-reverse primal-dual
On page migration and other relaxed task systems
Breaking the 2-competitiveness barrier for two servers in a tree
The k-Server Problem with Delays on the Uniform Metric Space
Competitive Algorithms for Generalized k -Server in Uniform Metrics
A randomized algorithm for two servers in cross polytope spaces
Competitive analysis of on-line disk scheduling
Deterministic 3-server on a circle and the limitation of canonical potentials
Time efficient implementation for online k-server problem on trees
Online paging with heterogeneous cache slots
Geometric two-server algorithms
The online min-sum set cover problem
Distributional online weighted paging with limited horizon
Boosting double coverage for k-server via imperfect predictions
Towards the k-server conjecture: a unifying potential, pushing the frontier to the circle
Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
The minimum backlog problem
R-LINE: a better randomized 2-server algorithm on the line

This page was built for publication: An Optimal On-Line Algorithm for K Servers on Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3204037)