A primal–dual online algorithm for the k-server problem on weighted HSTs-Reference-Cited by-同舟云学术

A primal–dual online algorithm for the k-server problem on weighted HSTs

Published:2017-05-09 Issue:4 Volume:34 Page:1133-1146
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Chen Wenbin,Li Fufang,Wang Jianxiong,Qi Ke,Tang Maobin,Wang Xiuni

Funder

NSFC

Higher Education of Guangdong

Guangdong Province’s Science and Technology Projects

Guangzhou Science and Technology Plan Project

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/article/10.1007/s10878-017-0135-z/fulltext.html

Reference36 articles.

1. Achlioptas D, Chrobak M, Noga J (2000) Competitive analysis of randomized paging algorithms. Theor Comput Sci 234(1–2):203–218

2. Bansal N, Buchbinder N, Madry A, Naor J (2011) A polylogarithmic-competitive algorithm for the $$k$$ k -server problem. In: FOCS 2011, pp 267–276

3. Bansal N, Buchbinder N, Naor JS (2007) A primal-dual randomized algorithm for weighted paging. In: Proceedings of the 48th annual IEEE symposium on foundations of computer science, pp 507–517, 2007

4. Bansal N, Buchbinder N, Naor JS (2010) Metrical task systems and the $$k$$ k -server problem on HSTs. In ICALP’10: Proceedings of the 37th international colloquium on automata, languages and programming, 2010, pp 287–298

5. Bansal N, Buchbinder N, Naor JS (2010) Towards the randomized k-server conjecture: a primal-dual approach. In: Proceedings of the 21st annual ACM-SIAM symposium on discrete algorithms, pp 40–55, 2010