Competitive algorithms for server problems
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Randomized algorithm for the \(k\)-server problem on decomposable spaces
- Randomized algorithms for metrical task systems
- A note on the server problem and a benevolent adversary
- A competitive 2-server algorithm
- HARMONIC is 3-competitive for two servers
- Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and \(N\)-step SCAN
- The online graph bandwidth problem
- The weighted list update problem and the lazy adversary
- The combinatorics of effective resistances and resistive inverses
- Unfair problems and randomized algorithms for metrical task systems
- On the power of randomization in on-line algorithms
- On-line algorithms for locating checkpoints
- A new measure for the study of on-line algorithms
- On lookahead in the list update problem
- Competitive randomized algorithms for nonuniform problems
- A deterministic O(k^ 3)-competitive k-server algorithm for the circle
- Competitive k-server algorithms
- Lower bounds for on-line graph coloring
- The list update problem and the retrieval of sets
- A lower bound for two-server balancing algorithms
- On-line algorithms for weighted bipartite matching and stable marriages
- The 2-evader problem
- Distributed near-optimal matching
- Paging more than one page
- More on randomized on-line algorithms for caching.
- More on weighted servers or FIFO is better than LRU.
- On the competitiveness of the move-to-front rule
- Competitive analysis of randomized paging algorithms
- k-server problems with bulk requests: an application to tool switching in manufacturing
- Randomized competitive analysis for two server problems
- On the additive constant of the k-server work function algorithm
- A primal-dual online algorithm for the k-server problem on weighted HSTs
- The K-server problem via a modern optimization lens
- Online in-time service problem with minimal server assignment
- Tight bounds for double coverage against weak adversaries
- Benchmarking online dispatch algorithms for emergency medical services
- The \(k\)-resource problem in uniform metric spaces
- On list update and work function algorithms.
- 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
- The CNN problem and other k-server variants
- Memoryless algorithms for the generalized k-server problem on uniform metrics
- Randomized online computation with high probability guarantees
- Approximation algorithms for clustering with dynamic points
- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
- Paging with request sets
- The online \(k\)-server problem with rejection
- The online \(k\)-server problem with max-distance objective
- Online file caching with rejection penalties
- The orthogonal CNN problem
- Competitive algorithms for the bicriteria \(k\)-server problem
- Calculating lower bounds for caching problems
- Ramsey-type theorems for metric spaces with applications to online problems
- A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
- The k-client problem
- A better lower bound on the competitive ratio of the randomized 2-server problem
- The working set algorithm has competitive ratio less than two
- On-line algorithms for the dominating set problem
- Uniform multipaging reduces to paging
- A simple analysis of the harmonic algorithm for two servers
- 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
- New Ressults on Server Problems
- Randomized Competitive Analysis for Two-Server Problems
- On the additive constant of the \(k\)-server work function algorithm
- The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms
- scientific article; zbMATH DE number 2038743 (Why is no real title available?)
- The \(k\)-server problem
- scientific article; zbMATH DE number 742965 (Why is no real title available?)
- A randomized O(^2k)-competitive algorithm for metric bipartite matching
- 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
- Randomized online multi-threaded paging
- Serving requests with on-line routing
- Randomized algorithms for metrical task systems
- Competitive algorithms for the on-line traveling salesman
- Limit theorems and structural properties of the cat-and-mouse Markov chain and its generalisations
- Multi-Finger Binary Search Trees
- Better Bounds for Online Line Chasing
- Paging more than one page
- Constrained TSP and low-power computing
- scientific article; zbMATH DE number 7204466 (Why is no real title available?)
- scientific article; zbMATH DE number 7236471 (Why is no real title available?)
- Online server allocation in a server farm via benefit task systems
- scientific article; zbMATH DE number 969167 (Why is no real title available?)
- Online computation with advice
- A Randomized Algorithm for Two Servers in Cross Polytope Spaces
- ON THE k-TRUCK SCHEDULING PROBLEM
- Managing multiple mobile resources
- Online facility assignment
- Dynamic location problems with limited look-ahead
- Two online algorithms for the ambulance systems
- On page migration and other relaxed task systems
- Online paging and file caching with expiration times
- Breaking the 2-competitiveness barrier for two servers in a tree
- The k-Server Problem with Delays on the Uniform Metric Space
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)
