Probabilistic approximation of metric spaces and its algorithmic applications

Yair Bartal*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

559 Scopus citations

Abstract

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 languageAmerican English
Pages (from-to)184-193
Number of pages10
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
StatePublished - 1996
Externally publishedYes
EventProceedings of the 1996 37th Annual Symposium on Foundations of Computer Science - Burlington, VT, USA
Duration: 14 Oct 199616 Oct 1996

Fingerprint

Dive into the research topics of 'Probabilistic approximation of metric spaces and its algorithmic applications'. Together they form a unique fingerprint.

Cite this