An optimal online algorithm for metrical task systems
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
A polylog(n)-competitive algorithm for metrical task systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On-line learning and the metrical task system problem
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Randomized algorithms for metrical task systems
Theoretical Computer Science
Online computation and competitive analysis
Online computation and competitive analysis
Unfair problems and randomized algorithms for metrical task systems
Information and Computation
On algorithm design for metrical task systems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Metrical Task Systems, the Server Problem and the Work Function Algorithm
Developments from a June 1996 seminar on Online algorithms: the state of the art
A regularization approach to metrical task systems
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
| Hi-index | 0.89 |
We give a randomized algorithm (the "Wedge Algorithm") of competitiveness for any metrical task system on a uniform space of k points, for any k≥2, where , the kth harmonic number. This algorithm has better competitiveness than the Irani-Seiden algorithm if k is smaller than 108. The algorithm is better by a factor of 2 if k