A new technique for the analysis of randomized algorithms for optimization problems on metric spaces is introduced. This technique relates the randomized performance ratio for any metric space to the randomized performance ratio for a set of simple metric spaces. This technique is of particular interest in the context of online computation since a large number of online algorithmic problems are defined in terms of some metric space. Two different online problems, metrical task system and constrained file migration, were used to demonstrate the efficiency of the technique.
|Original language||American English|
|Number of pages||10|
|Journal||Annual Symposium on Foundations of Computer Science - Proceedings|
|State||Published - 1996|
|Event||Proceedings of the 1996 37th Annual Symposium on Foundations of Computer Science - Burlington, VT, USA|
Duration: 14 Oct 1996 → 16 Oct 1996