Return of the Boss Problem: Competing Online against a Non-adaptive Adversary
暂无分享,去创建一个
[1] Refael Hassin,et al. Robust Matchings , 2002, SIAM J. Discret. Math..
[2] Thomas P. Hayes,et al. Robbing the bandit: less regret in online geometric optimization against an adaptive adversary , 2006, SODA '06.
[3] Susanne Albers,et al. Better bounds for online scheduling , 1997, STOC '97.
[4] György Turán,et al. On the performance of on-line algorithms for partition problems , 1989, Acta Cybern..
[5] Yossi Azar,et al. Convex programming for scheduling unrelated parallel machines , 2005, STOC '05.
[6] Rajiv Gandhi,et al. Improved results for data migration and open shop scheduling , 2004, TALG.
[7] Takuro Fukunaga,et al. Robust cost colorings , 2008, SODA '08.
[8] Ashish Goel,et al. Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs , 2006, Algorithmica.
[9] Leah Epstein,et al. On the Max Coloring Problem , 2007, WAOA.
[10] Gerhard J. Woeginger,et al. All-norm approximation algorithms , 2002, J. Algorithms.
[11] Yuval Rabani,et al. A Better Lower Bound for On-Line Scheduling , 1994, Inf. Process. Lett..
[12] Allan Borodin,et al. Online computation and competitive analysis , 1998 .