Breaking the 2-competitiveness barrier for two servers in a tree (Q6052700)

From MaRDI portal
Revision as of 01:29, 26 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7751508
Language Label Description Also known as
English
Breaking the 2-competitiveness barrier for two servers in a tree
scientific article; zbMATH DE number 7751508

    Statements

    Breaking the 2-competitiveness barrier for two servers in a tree (English)
    0 references
    0 references
    0 references
    17 October 2023
    0 references
    0 references
    online algorithms
    0 references
    randomized algorithms
    0 references
    tree metric spaces
    0 references
    server problem
    0 references
    T-theory
    0 references
    game theory
    0 references