New Ressults on Server Problems
From MaRDI portal
Recommendations
Cited in
(79)- The online graph bandwidth problem
- 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
- A lower bound for two-server balancing algorithms
- Connection caching: Model and algorithms.
- More on weighted servers or FIFO is better than LRU.
- k-server problems with bulk requests: an application to tool switching in manufacturing
- Trackless online algorithms for the server problem
- Randomized competitive analysis for two server problems
- The K-server problem via a modern optimization lens
- The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
- Tight bounds for double coverage against weak adversaries
- The \(k\)-resource problem in uniform metric spaces
- The 3-server problem in the plane.
- On randomization in on-line computation.
- 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
- Greedy -approximation algorithm for covering with arbitrary constraints and submodular cost
- Metrical service systems with multiple servers
- Stochastic dominance and the bijective ratio of online algorithms
- The online \(k\)-server problem with rejection
- The online \(k\)-server problem with max-distance objective
- Online file caching with rejection penalties
- A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
- How to whack moles
- The k-client problem
- Stochastic analysis of the k-server problem on the circle
- A fast work function algorithm for solving the k-server problem
- On variants of file caching
- A fast approximate implementation of the work function algorithm for solving the k-server problem
- Competitive algorithms for server problems
- Randomized Competitive Analysis for Two-Server Problems
- Caching Content under Digital Rights Management
- A fast implementation of the optimal off-line algorithm for solving the k-server problem
- scientific article; zbMATH DE number 1500546 (Why is no real title available?)
- The \(k\)-server problem
- scientific article; zbMATH DE number 1929943 (Why is no real title available?)
- scientific article; zbMATH DE number 1446755 (Why is no real title available?)
- The Infinite Server Problem
- On the advice complexity of the \(k\)-server problem under sparse metrics
- Caching with time windows and delays
- scientific article; zbMATH DE number 7204466 (Why is no real title available?)
- Online server allocation in a server farm via benefit task systems
- On a Slow Server Problem
- scientific article; zbMATH DE number 969167 (Why is no real title available?)
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces
- Fundamentals of Computation Theory
- ON THE k-TRUCK SCHEDULING PROBLEM
- An \(O(\log k)\)-competitive algorithm for generalized caching
- Dynamic pricing of servers on trees
- Approximation and Online Algorithms
- Online \(k\)-taxi via double coverage and time-reverse primal-dual
- Managing multiple mobile resources
- Online \(k\)-taxi via double coverage and time-reverse primal-dual
- Dynamic location problems with limited look-ahead
- 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
- Relative Worst-Order Analysis: A Survey
- A randomized algorithm for two servers in cross polytope spaces
- Deterministic 3-server on a circle and the limitation of canonical potentials
- Online paging with heterogeneous cache slots
- Geometric two-server algorithms
- Online algorithms for weighted paging with predictions
- The online min-sum set cover problem
- Caching is hard -- even in the fault model
- Boosting double coverage for k-server via imperfect predictions
- Complexity of fixed order routing
- Towards the k-server conjecture: a unifying potential, pushing the frontier to the circle
- Geometric bipartite matching based exact algorithms for server problems
- Time-optimal k-server
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
- The relative worst-order ratio applied to paging
- R-LINE: a better randomized 2-server algorithm on the line
This page was built for publication: New Ressults on Server Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348410)
