Competitive algorithms for server problems
From MaRDI portal
Publication:3485852
Recommendations
Cited in
(only showing first 100 items - show all)- scientific article; zbMATH DE number 2038743 (Why is no real title available?)
- Randomized algorithm for the \(k\)-server problem on decomposable spaces
- More on randomized on-line algorithms for caching.
- Competitive strategy for on-line leasing of depreciable equipment
- HARMONIC is 3-competitive for two servers
- The weighted list update problem and the lazy adversary
- Online computation with advice
- Distributed near-optimal matching
- A general decomposition theorem for the \(k\)-server problem
- On-line algorithms for weighted bipartite matching and stable marriages
- On the remote server problem or more about TCP acknowledgments
- R-LINE: a better randomized 2-server algorithm on the line
- The minimum backlog problem
- The \(K\)-server problem via a modern optimization lens
- A better lower bound on the competitive ratio of the randomized 2-server problem
- The working set algorithm has competitive ratio less than two
- The \(k\)-client problem
- Randomized Competitive Analysis for Two-Server Problems
- Ramsey-type theorems for metric spaces with applications to online problems
- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
- On page migration and other relaxed task systems
- Paging more than one page
- Randomized algorithms for metrical task systems
- Competitive randomized algorithms for nonuniform problems
- The weighted 2-server problem
- SIMPLE: An optimal disk system with two restricted heads
- On metric clustering to minimize the sum of radii
- Paging with request sets
- Online chasing problems for regular polygons
- Geometric two-server algorithms
- On the competitiveness of the move-to-front rule
- On the additive constant of the \(k\)-server work function algorithm
- A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle
- The 2-evader problem
- The orthogonal CNN problem
- Lower bounds for on-line graph coloring
- An on-line multi-CBR agent dispatching algorithm
- On the additive constant of the \(k\)-server work function algorithm
- 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
- Competitive analysis of randomized paging algorithms
- Of robot ants and elephants: a computational comparison
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces
- A randomized algorithm for two servers in cross polytope spaces
- The CNN problem and other \(k\)-server variants
- Randomized competitive analysis for two server problems
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
- On multi-threaded metrical task systems
- On-line algorithms for locating checkpoints
- More on weighted servers or FIFO is better than LRU.
- A new measure for the study of on-line algorithms
- Online Metric Algorithms with Untrusted Predictions
- Competitive \(k\)-server algorithms
- The \(k\)-server problem
- Dynamic location problems with limited look-ahead
- On the advice complexity of the \(k\)-server problem under sparse metrics
- A strongly competitive randomized paging algorithm
- A randomized algorithm for two servers on the line.
- The 3-server problem in the plane.
- The online graph bandwidth problem
- Uniform multipaging reduces to paging
- A simple analysis of the harmonic algorithm for two servers
- A competitive 2-server algorithm
- \(k\)-server problems with bulk requests: an application to tool switching in manufacturing
- On-line algorithms for the dominating set problem
- Competitive algorithms for the on-line traveling salesman
- On the power of randomization in on-line algorithms
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching
- Online \(k\)-server routing problems
- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
- Online paging and file caching with expiration times
- ON THE k-TRUCK SCHEDULING PROBLEM
- Online file caching with rejection penalties
- Limit theorems and structural properties of the cat-and-mouse Markov chain and its generalisations
- The k-Server Problem with Delays on the Uniform Metric Space
- A lower bound for two-server balancing algorithms
- On lookahead in the list update problem
- Memoryless algorithms for the generalized k-server problem on uniform metrics
- Improved and deterministic online service with deadlines or delay
- Approximation algorithms for clustering with dynamic points
- Competitive Algorithms for Generalized k -Server in Uniform Metrics
- Two online algorithms for the ambulance systems
- Multi-Finger Binary Search Trees
- Chasing convex bodies optimally
- Randomized online computation with high probability guarantees
- Calculating lower bounds for caching problems
- Online server allocation in a server farm via benefit task systems
- On list update and work function algorithms.
- Competitive algorithms for the bicriteria \(k\)-server problem
- scientific article; zbMATH DE number 742965 (Why is no real title available?)
- Parametrized Metrical Task Systems
- A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs
- Breaking the 2-competitiveness barrier for two servers in a tree
- Constrained TSP and low-power computing
- The \(k\)-resource problem in uniform metric spaces
- Online paging with heterogeneous cache slots
- Randomized algorithms for metrical task systems
- scientific article; zbMATH DE number 7236471 (Why is no real title available?)
- On variants of file caching
- A note on the server problem and a benevolent adversary
This page was built for publication: Competitive algorithms for server problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3485852)
