Breaking the 2-competitiveness barrier for two servers in a tree (Q6052700): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2023.114152 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4386226759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A canonical decomposition theory for metrics on a finite set / rank
 
Normal rank
Property / cites work
 
Property / cites work: R-LINE: a better randomized 2-server algorithm on the line / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic-Competitive Algorithm for the k-Server Problem / 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: A randomized algorithm for two servers on the line. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type theorems for metric spaces with applications to online problems / 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: Randomized competitive analysis for two server problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm for two servers in cross polytope spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast algorithms for two servers / 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: New Ressults on Server Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better lower bound on the competitive ratio of the randomized 2-server problem / 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: A randomized on–line algorithm for the <i>k</i>–server problem on a line / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-theory: An overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Six theorems about injective metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Competitive Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for server problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5484522 / rank
 
Normal rank

Latest revision as of 06:24, 3 August 2024

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
    0 references