New Ressults on Server Problems
From MaRDI portal
Publication:3348410
DOI10.1137/0404017zbMath0726.68031OpenAlexW2089998595MaRDI QIDQ3348410
No author found.
Publication date: 1991
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0404017
Related Items (53)
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 ⋮ The weighted 2-server problem ⋮ On the competitive ratio of the work function algorithm for the \(k\)-server problem ⋮ The CNN problem and other \(k\)-server variants ⋮ 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 ⋮ Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications ⋮ Randomized competitive analysis for two server problems ⋮ General caching is hard: even with small pages ⋮ The relative worst-order ratio applied to paging ⋮ Caching with Time Windows and Delays ⋮ R-LINE: a better randomized 2-server algorithm on the line ⋮ Breaking the 2-competitiveness barrier for two servers in a tree ⋮ Competitive Algorithms for Generalized k -Server in Uniform Metrics ⋮ Connection caching: Model and algorithms. ⋮ A randomized algorithm for two servers in cross polytope spaces ⋮ Relative Worst-Order Analysis: A Survey ⋮ Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost ⋮ The \(k\)-server problem ⋮ Randomized Competitive Analysis for Two-Server Problems ⋮ The \(K\)-server problem via a modern optimization lens ⋮ ON THE k-TRUCK SCHEDULING PROBLEM ⋮ Dynamic pricing of servers on trees ⋮ A comparison of performance measures for online algorithms ⋮ The \(k\)-server problem with advice in \(d\) dimensions and on the sphere ⋮ Geometric two-server algorithms ⋮ Tight bounds for double coverage against weak adversaries ⋮ On the advice complexity of the \(k\)-server problem under sparse metrics ⋮ On Variants of File Caching ⋮ The k-Server Problem with Delays on the Uniform Metric Space ⋮ The online graph bandwidth problem ⋮ The \(k\)-resource problem in uniform metric spaces ⋮ Caching is hard -- even in the fault model ⋮ Metrical service systems with multiple servers ⋮ A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem ⋮ Caching Content under Digital Rights Management ⋮ A Randomized Algorithm for Two Servers in Cross Polytope Spaces ⋮ Online \(k\)-taxi via double coverage and time-reverse primal-dual ⋮ Managing multiple mobile resources ⋮ Online \(k\)-taxi via double coverage and time-reverse primal-dual ⋮ Stochastic dominance and the bijective ratio of online algorithms ⋮ The online \(k\)-server problem with rejection ⋮ The 3-server problem in the plane. ⋮ On randomization in on-line computation. ⋮ A randomized algorithm for two servers on the line. ⋮ Unnamed Item ⋮ A general decomposition theorem for the \(k\)-server problem ⋮ The online \(k\)-server problem with max-distance objective ⋮ On-line algorithms for locating checkpoints ⋮ Online file caching with rejection penalties
This page was built for publication: New Ressults on Server Problems
