@article{oai:kanazawa-u.repo.nii.ac.jp:00008007,
 author = {Kawamura, Yasuyuki and Matsubayashi, Akira},
 issue = {12},
 journal = {IEICE Transactions on Information and Systems},
 month = {Dec},
 note = {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., 金沢大学大学院自然科学研究科電子情報科学専攻},
 pages = {2416--2421},
 title = {Randomized Online File Allocation on Uniform Cactus Graphs},
 volume = {92-D},
 year = {2009}
}