Competitive algorithms for server problems
References (11)
- D. Black and D. D. Sleator, Algorithms for the 1-server problem with excursions, in...
- et al.
An optimal online algorithm for metrical task systems
- et al.
Sequencing problems in two-server systems
Math. Oper. Res.
(1985) - et al.
Sequencing two servers on a sphere
Commun. Statist.-Stochastic Models
(1985) - et al.
Competitive Paging Algorithms
Carnegie Mellon University Computer Science technical report CMU-CS-88–196
(1988)
There are more references available in the full text version of this article.
Cited by (385)
Breaking the 2-competitiveness barrier for two servers in a tree
2023, Theoretical Computer ScienceApproximation algorithms for clustering with dynamic points
2022, Journal of Computer and System SciencesLimit theorems and structural properties of the cat-And-mouse Markov chain and its generalisations
2022, Advances in Applied ProbabilityTowards Fairness in Online Service with K Servers and Its Application on Fair Food Delivery
2024, Proceedings of the AAAI Conference on Artificial IntelligenceToward Online Mobile Facility Location on General Metrics
2023, Theory of Computing Systems
- ∗
Part of the work of the second author was done at Carnegie-Mellon University and was supported by an NSF Graduate Fellowship and by NSF Grants DCR-8352081 and MCS-8308805.
- †
Partial support provided by DARPA, ARPA order 4976, Amendment 20, monitored by the Air Force Avionics Laboratory under Contract F33615-87-C-1499, and by the National Science Foundation under Grant CCR-8658139.
Copyright © 1990 Published by Elsevier Inc.