A competitive 2-server algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2038743
- Competitive k-server algorithms
- Competitive algorithms for server problems
- Randomized Competitive Analysis for Two-Server Problems
- Randomized competitive analysis for two server problems
- On fast algorithms for two servers
- scientific article; zbMATH DE number 4215366
- A better lower bound on the competitive ratio of the randomized 2-server problem
- A randomized algorithm for two servers on the line.
- Competitive algorithms for the bicriteria \(k\)-server problem
Cites work
Cited in
(42)- HARMONIC is 3-competitive for two servers
- 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
- Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space
- k-server problems with bulk requests: an application to tool switching in manufacturing
- Trackless online algorithms for the server problem
- Limited bookmark randomized online algorithms for the paging problem
- Randomized competitive analysis for two server problems
- Online in-time service problem with minimal server assignment
- The weighted 2-server problem
- Competitive algorithms for the bicriteria \(k\)-server problem
- A \(k\)-server problem with parallel requests and unit distances
- An application of various algorithms for solving the k-server problem
- The k-client problem
- A simple analysis of the harmonic algorithm for two servers
- On the continuous CNN problem
- On the bicriteria k-server problem
- New Ressults on Server Problems
- scientific article; zbMATH DE number 4215366 (Why is no real title available?)
- Competitive algorithms for server problems
- The generalized two-server problem
- A New Approach to the Server Problem
- On fast algorithms for two servers
- Generosity Helps or an 11-Competitive Algorithm for Three Servers
- The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms
- scientific article; zbMATH DE number 2038743 (Why is no real title available?)
- The Online Transportation Problem
- scientific article; zbMATH DE number 1500546 (Why is no real title available?)
- The \(k\)-server problem
- scientific article; zbMATH DE number 742965 (Why is no real title available?)
- Randomized algorithms for the on-line minimum matching problem on euclidean space
- scientific article; zbMATH DE number 7204466 (Why is no real title available?)
- Dynamic pricing of servers on trees
- Managing multiple mobile resources
- Managing multiple mobile resources
- Dynamic location problems with limited look-ahead
- Two online algorithms for the ambulance systems
- The online transportation problem
- Geometric two-server algorithms
- Online chasing problems for regular polygons
This page was built for publication: A competitive 2-server algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182124)
