A fast implementation of the optimal off-line algorithm for solving the k-server problem

被引：0
|
作者：
Rudec, Tomislav [2 ]
Baumgartner, Alfonzo [2 ]
Manger, Robert [1 ]
机构：
[1] Univ Zagreb, Dept Math, Zagreb 10000, Croatia
[2] Univ Osijek, Fac Elect Engn, Osijek 31000, Croatia
来源：
MATHEMATICAL COMMUNICATIONS | 2009年 / 14卷 / 01期
关键词：
k-server problem; off-line algorithms; on-line algorithms; optimality; implementation; network flows; execution time; experiments; EFFICIENCY;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The optimal off-line algorithm for solving the k-server problem is usually implemented by network flows. In this paper, we first propose certain modifications to each step of the original network-flow implementation. Next, by experiments we demonstrate that the proposed modifications improve the speed of the algorithm. Finally, we investigate how similar ideas for improvement can also be applied to some related on-line algorithms.
引用
收藏
页码：119 / 134
页数：16
相关论文
共 50 条
  • [21] The online k-server problem with rejection
    Bittner, E.
    Imreh, Cs.
    Nagy-Gyoergy, J.
    DISCRETE OPTIMIZATION, 2014, 13 : 1 - 15
  • [22] On the Advice Complexity of the k-Server Problem
    Boeckenhauer, Hans-Joachim
    Komm, Dennis
    Kralovic, Rastislav
    Kralovic, Richard
    AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT I, 2011, 6755 : 207 - 218
  • [23] A new upper bound on the work function algorithm for the k-server problem
    Zhang, Wenming
    Cheng, Yongxi
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (02) : 509 - 518
  • [24] A new upper bound on the work function algorithm for the k-server problem
    Wenming Zhang
    Yongxi Cheng
    Journal of Combinatorial Optimization, 2020, 39 : 509 - 518
  • [25] On the advice complexity of the k-server problem
    Boeckenhauer, Hans-Joachim
    Komm, Dennis
    Kralovic, Rastislav
    Kralovic, Richard
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 86 : 159 - 170
  • [26] A primal–dual online algorithm for the k-server problem on weighted HSTs
    Wenbin Chen
    Fufang Li
    Jianxiong Wang
    Ke Qi
    Maobin Tang
    Xiuni Wang
    Journal of Combinatorial Optimization, 2017, 34 : 1133 - 1146
  • [27] The harmonic k-server algorithm is competitive
    Bartal, Y
    Grove, E
    JOURNAL OF THE ACM, 2000, 47 (01) : 1 - 15
  • [28] Approximability of the k-server disconnection problem
    Hong, Sung-Pil
    Choi, Byung-Cheon
    NETWORKS, 2007, 50 (04) : 273 - 282
  • [29] k-server optimal task scheduling problem with convex cost function
    Lin, MJ
    Ma, YL
    PROCEEDINGS OF THE THIRD INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS, 2005, : 345 - 350
  • [30] A Polylogarithmic-Competitive Algorithm for the k-Server Problem (Extended Abstract)
    Bansal, Nikhil
    Buchbinder, Niv
    Madry, Aleksander
    Naor, Joseph
    2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 267 - 276
12345