Time Efficient Implementation for Online K-Server Problem on Trees

被引：0
|
作者：
Khadiev, Kamil [1 ]
Yagafarov, Maxim [1 ]
机构：
[1] Kazan Fed Univ, Kazan, Russia
来源：
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2024 | 2024年 / 14637卷
关键词：
online algorithms; k-server problem on trees; time complexity; time efficient implementation; FINDING LEVEL-ANCESTORS; ALGORITHMS; QUANTUM;
D O I：
10.1007/978-981-97-2340-9_25
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We consider online algorithms for the k-server problem on trees of size n. Chrobak and Larmore proposed a k-competitive algorithm for this problem that has the optimal competitive ratio. However, the existing implementations have O (k(2) + k center dot log n) or O (k(log n)(2)) time complexity for processing a query, where n is the number of nodes. We propose a new time-efficient implementation of this algorithm that has O(n) time complexity for preprocessing and O (k log k) time for processing a query. The new algorithm is faster than both existing algorithms and the time complexity for query processing does not depend on the tree size.
引用
收藏
页码：296 / 308
页数：13
相关论文
共 50 条
  • [21] Competitive algorithms for the bicriteria k-server problem
    Flammini, Michele
    Nicosia, Gaia
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (15) : 2117 - 2127
  • [22] The k-server problem: A reinforcement learning approach
    Leandro, M
    Neto, ADD
    Melo, JD
    Proceedings of the International Joint Conference on Neural Networks (IJCNN), Vols 1-5, 2005, : 798 - 802
  • [23] The CNN problem and other k-server variants
    Koutsoupias, E
    Taylor, DS
    STACS 2000: 17TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2000, 1770 : 581 - 592
  • [24] A Polylogarithmic-Competitive Algorithm for the k-Server Problem
    Bansal, Nikhil
    Buchbinder, Niv
    Madry, Aleksander
    Naor, Joseph
    JOURNAL OF THE ACM, 2015, 62 (05)
  • [25] A fast implementation of the optimal off-line algorithm for solving the k-server problem
    Rudec, Tomislav
    Baumgartner, Alfonzo
    Manger, Robert
    MATHEMATICAL COMMUNICATIONS, 2009, 14 (01) : 119 - 134
  • [26] The K-server problem via a modern optimization lens
    Bertsimas, Dimitris
    Jaillet, Patrick
    Korolko, Nikita
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 276 (01) : 65 - 78
  • [27] Deep reinforcement learning applied to the k-server problem
    Sousa Lins, Ramon Augusto
    Neto Doria, Adriao Duarte
    de Melo, Jorge Dantas
    EXPERT SYSTEMS WITH APPLICATIONS, 2019, 135 : 212 - 218
  • [28] A network flow implementation of a modified work function algorithm for solving the k-server problem
    Baumgartner, Alfonzo
    Manger, Robert
    Hocenski, Zeljko
    SOR'07: PROCEEDINGS OF THE 9TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH IN SLOVENIA, 2007, : 83 - +
  • [29] Randomized algorithm for the k-server problem on decomposable spaces
    Nagy-Gyorgy, Judit
    JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (04) : 411 - 419
  • [30] The k-Server Problem with Advice in d Dimensions and on the Sphere
    Elisabet Burjons
    Dennis Komm
    Marcel Schöngens
    Algorithmica, 2019, 81 : 1859 - 1880
12345