论文信息 - A better algorithm for uniform metrical task systems with few states

A better algorithm for uniform metrical task systems with few states

We give a randomized algorithm (the "Wedge Algorithm") of competitiveness for any metrical task system on a uniform space of k points. This algorithm has better competitiveness than the Irani-Seiden algorithm if k is smaller than 10/sup 8/. The algorithm is better by a factor of 2 if k < 47.

Lawrence L. Larmore | Wolfgang W. Bein | John Noga

[1] Andrew Tomkins,et al. A polylog(n)-competitive algorithm for metrical task systems , 1997, STOC '97.

[2] Allan Borodin,et al. An optimal on-line algorithm for metrical task system , 1992, JACM.

[3] Sandy Irani,et al. On Algorithm Design for Metrical Task Systems , 1995, SODA '95.

[4] Allan Borodin,et al. An optimal online algorithm for metrical task systems , 1987, STOC.

[5] Marek Chrobak,et al. Metrical Task Systems, the Server Problem and the Work Function Algorithm , 1996, Online Algorithms.

[6] Steven S. Seiden,et al. Unfair Problems and Randomized Algorithms for Metrical Task Systems , 1999, Inf. Comput..

[7] Avrim Blum,et al. On-line Learning and the Metrical Task System Problem , 1997, COLT.

[8] Sandy Irani,et al. Randomized Algorithms for Metrical Task Systems , 1998, Theor. Comput. Sci..