Towards the randomized k-server conjecture: A primal-dual approach

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 40-55

  Bansal, Nikhil ^a   Buchbinder, Niv ^b   Naor, Joseph ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b MICROSOFT RESEARCH   (United Kingdom)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOX CONSTRAINTS; COMPETITIVE ALGORITHMS; COMPETITIVE FACTOR; COVERING AND PACKING; EXPERT ADVICE; K-SERVER; K-SERVER PROBLEM; LINEAR PROGRAMS; MODEL PROBLEMS; NATURAL PROPERTIES; OFFLINE; ON-LINE ALGORITHMS; ONLINE PREDICTION; ONLINE PROBLEMS; OPEN PROBLEMS; POLYLOGARITHMIC; PRIMAL-DUAL; PRIMAL-DUAL APPROACH; REGRET MINIMIZATION; TWO-POINT;

ALGORITHMS; SERVERS;

PROBLEM SOLVING;

EID: 77951684094     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Nikhil Bansal, Niv Buchbinder, and Joseph (Seffi) Naor. Unfair metrical task systems on hsts and applications. In Manuscript, submitted to SODA 2010.
2. Nikhil Bansal, Niv Buchbinder, and Joseph (Seffi) Naor. A primal-dual randomized algorithm for weighted paging. In FOCS '07: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pages 507-517, 2007.
3. Yair Bartal, Avrim Blum, Carl Burch, and Andrew Tomkins. A polylog(n)-competitive algorithm for metrical task systems. In Proceedings of the 29th Annual ACM Symposium on Theory of computing, pages 711-719, 1997.
4. Avrim Blum, Carl Burch, and Adam Kalai. Finely-competitive paging. In IEEE Symposium on Foundations of Computer Science, pages 450-458, 1999.
5. Allan Borodin and Ran El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998.
6. Allan Borodin, Nathan Linial, and Michael E. Saks. An optimal on-line algorithm for metrical task system. J. ACM, 39(4):745-763, 1992.
7. N. Buchbinder and J. Naor. Online primal-dual algorithms for covering and packing problems. In 13th Annual European Symposium on Algorithms, 2005.
8. N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. 2006.
9. M. Chrobak and L. Larmore. An optimal on-line algorithm for k-servers on trees. SIAM Journal on Computing, 20(1):144-148, 1991.
10. A. Coté, A. Meyerson, and L. Poplawski. Randomized k-server on hierarchical binary trees. In STOC '08: Proceedings of the 40th annual ACM symposium on Theory of computing, pages 227-234, 2008.
11. B. Csaba and S. Lodha. A randomized on-line algorithm for the k-server problem on a line. Random Structures and Algorithms, 29(1):82-104, 2006.
12. A. Fiat, Y. Rabani, and Y. Ravid. Competitive k-server algorithms. Journal of Computer and System Sciences, 48(3):410-428, 1994.
13. Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, and Neal E. Young. Competitive paging algorithms. J. Algorithms, 12(4):685-699, 1991.
14. Amos Fiat and Manor Mendel. Better algorithms for unfair metrical task systems and applications. SIAM J. Comput., 32(6):1403-1422, 2003.
15. Elias Koutsoupias and Christos H. Papadimitriou. On the k-server conjecture. J. ACM, 42(5):971-983, 1995.
16. M. Manasse, L.A. McGeoch, and D. Sleator. Competitive algorithms for server problems. Journal of Algorithms, 11:208-230, 1990.
17. Steven S. Seiden. A general decomposition theorem for the k-server problem. In ESA '01: Proceedings of the 9th Annual European Symposium on Algorithms, pages 86-97, 2001. (Pubitemid 33328949)
18. S. Shalev-Shwartz and Y. Singer. A primal-dual perspective of online learning algorithms. Machine Learning Journal, 69(2/3):115-142, 2007. (Pubitemid 47574312)
19. Daniel D. Sleator and Robert E. Tarjan. Amortized efficiency of list update and paging rules. Commun. ACM, 28(2):202-208, 1985.