The \(k\)-server problem (Q458484): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the <i>k</i>-server conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the <i>k</i> -server conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for server problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal on-line algorithm for metrical task system / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Ressults on Server Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal On-Line Algorithm for <i>K</i> Servers on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths without a map / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: New algorithms for an ancient scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive \(k\)-server algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of randomization in on-line algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-evader problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generosity Helps or an 11-Competitive Algorithm for Three Servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-server problem in the plane. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The harmonic <i>k</i> -server algorithm is competitive / rank
 
Normal rank
Property / cites work
 
Property / cites work: HARMONIC is 3-competitive for two servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on weighted graphs and applications to on-line algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Algorithms for Unfair Metrical Task Systems and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive analysis of randomized paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Competitive Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Randomized Algorithm for Weighted Paging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive randomized algorithms for nonuniform problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On metric Ramsey-type phenomena / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Algorithms for Layered Graph Traversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted 2-server problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the competitive ratio of the work function algorithm for the \(k\)-server problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness in Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive 2-server algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast algorithms for two servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on random walks, electrical networks, and the harmonic \(k\)-server algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring an unknown graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to learn an unknown environment. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the value of information in distributed decision-making (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming without the matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank

Latest revision as of 03:39, 9 July 2024

scientific article
Language Label Description Also known as
English
The \(k\)-server problem
scientific article

    Statements

    The \(k\)-server problem (English)
    0 references
    0 references
    7 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(k\)-server problem
    0 references
    online algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references