Design of Efficient Online Algorithms for Server Problems on Networks

13301甲第4735号博士（学術）金沢大学博士論文要旨Abstract 以下に掲載：Algorithms 9(3) pp.57/1-7 2016. MDPI AG. 共著者：Amanj Khorramian, Akira Matsubayash

Randomized Online File Allocation on Uniform Cactus Graphs

金沢大学大学院自然科学研究科電子情報科学専攻We study the online file allocation problem on ring networks. In this paper, we present a 7-competitive randomized algorithm against an adaptive online adversary on uniform cactus graphs. The algorithm is deterministic if the size is 1. Moreover, we obtain lower bounds of 4.25 and 3.833 for a deterministic algorithm and a randomized algorithm against an adaptive online adversary, respetively, on ring networks