Competitive algorithms for server problems
From MaRDI portal
Publication:3485852
Recommendations
Cited in
(only showing first 100 items - show all)- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
- A general decomposition theorem for the k-server problem
- Improved and deterministic online service with deadlines or delay
- The weighted 2-server problem
- On the advice complexity of the \(k\)-server problem under sparse metrics
- Two online algorithms for the ambulance systems
- A randomized algorithm for two servers in cross polytope spaces
- Randomized competitive analysis for two server problems
- On metric clustering to minimize the sum of radii
- Online paging with heterogeneous cache slots
- Limit theorems and structural properties of the cat-and-mouse Markov chain and its generalisations
- The list update problem and the retrieval of sets
- The online \(k\)-server problem with max-distance objective
- On page migration and other relaxed task systems
- SIMPLE: An optimal disk system with two restricted heads
- scientific article; zbMATH DE number 7236471 (Why is no real title available?)
- Competitive algorithms for the bicriteria \(k\)-server problem
- The \(k\)-client problem
- On list update and work function algorithms.
- scientific article; zbMATH DE number 742965 (Why is no real title available?)
- Ramsey-type theorems for metric spaces with applications to online problems
- Better Bounds for Online Line Chasing
- On-line algorithms for locating checkpoints
- Online file caching with rejection penalties
- ON THE k-TRUCK SCHEDULING PROBLEM
- Online k-server routing problems
- Online computation with advice
- On the remote server problem or more about TCP acknowledgments
- Distributed near-optimal matching
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces
- Paging with request sets
- Online in-time service problem with minimal server assignment
- Memoryless algorithms for the generalized k-server problem on uniform metrics
- Online chasing problems for regular polygons
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
- On multi-threaded metrical task systems
- The online \(k\)-server problem with rejection
- Lower bounds for on-line graph coloring
- Tight bounds for double coverage against weak adversaries
- Parametrized Metrical Task Systems
- An on-line multi-CBR agent dispatching algorithm
- Randomized online multi-threaded paging
- The combinatorics of effective resistances and resistive inverses
- A better lower bound on the competitive ratio of the randomized 2-server problem
- The working set algorithm has competitive ratio less than two
- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
- Randomized algorithms for metrical task systems
- Dynamic location problems with limited look-ahead
- On-line algorithms for the dominating set problem
- Calculating lower bounds for caching problems
- On the power of randomization in on-line algorithms
- Benchmarking online dispatch algorithms for emergency medical services
- On-line algorithms for weighted bipartite matching and stable marriages
- Of robot ants and elephants: a computational comparison
- Uniform multipaging reduces to paging
- A simple analysis of the harmonic algorithm for two servers
- Unfair problems and randomized algorithms for metrical task systems
- More on randomized on-line algorithms for caching.
- Randomized online computation with high probability guarantees
- Online Metric Algorithms with Untrusted Predictions
- The \(k\)-resource problem in uniform metric spaces
- The CNN problem and other k-server variants
- Online paging and file caching with expiration times
- The weighted list update problem and the lazy adversary
- Randomized algorithms for metrical task systems
- 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
- Paging more than one page
- A strongly competitive randomized paging algorithm
- The online graph bandwidth problem
- On the additive constant of the \(k\)-server work function algorithm
- Chasing convex bodies optimally
- Breaking the 2-competitiveness barrier for two servers in a tree
- Approximation algorithms for clustering with dynamic points
- The \(k\)-server problem
- Randomized Competitive Analysis for Two-Server Problems
- scientific article; zbMATH DE number 2038743 (Why is no real title available?)
- scientific article; zbMATH DE number 1446755 (Why is no real title available?)
- The k-Server Problem with Delays on the Uniform Metric Space
- R-LINE: a better randomized 2-server algorithm on the line
- The minimum backlog problem
- Competitive randomized algorithms for nonuniform problems
- The 2-evader problem
- The orthogonal CNN problem
- HARMONIC is 3-competitive for two servers
- On variants of file caching
- Multi-Finger Binary Search Trees
- Competitive Algorithms for Generalized k -Server in Uniform Metrics
- On the competitiveness of the move-to-front rule
- Competitive analysis of randomized paging algorithms
- A new measure for the study of on-line algorithms
- Paging more than one page
- On lookahead in the list update problem
- A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle
- More on weighted servers or FIFO is better than LRU.
- A randomized O(^2k)-competitive algorithm for metric bipartite matching
- Geometric two-server algorithms
- A note on the server problem and a benevolent adversary
- A competitive 2-server algorithm
- Managing multiple mobile resources
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)
