scientific article; zbMATH DE number 65695
From MaRDI portal
Publication:4010306
Cited in
(32)- A new upper bound on the work function algorithm for the \(k\)-server problem
- Online computation with advice
- On the competitive ratio of the work function algorithm for the \(k\)-server problem
- Metrical service systems with multiple servers
- A general decomposition theorem for the \(k\)-server problem
- On a Slow Server Problem
- Randomized Competitive Analysis for Two-Server Problems
- Randomized algorithms for metrical task systems
- The weighted 2-server problem
- Knowledge state algorithms
- Paging with request sets
- On list update and work function algorithms.
- Competitive algorithms for the bicriteria \(k\)-server problem
- On the additive constant of the \(k\)-server work function algorithm
- The 2-evader problem
- The work function algorithm for the paging problem
- An on-line multi-CBR agent dispatching algorithm
- On the additive constant of the \(k\)-server work function algorithm
- Stochastic dominance and the bijective ratio of online algorithms
- The online \(k\)-server problem with rejection
- Randomized competitive analysis for two server problems
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
- Tight bounds for double coverage against weak adversaries
- Trackless online algorithms for the server problem
- The \(k\)-server problem
- Dynamic location problems with limited look-ahead
- A randomized algorithm for two servers on the line.
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
- The 3-server problem in the plane.
- Deterministic 3-server on a circle and the limitation of canonical potentials
- Unfair problems and randomized algorithms for metrical task systems
- The online \(k\)-server problem with max-distance objective
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4010306)
