Sciweavers

APPROX
2010
Springer
137views Algorithms» more  APPROX 2010»
13 years 6 months ago
Online Embeddings
We initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points X = x1, . . . , xn one by one, from a metric space M = (X, D). Our goal...
Piotr Indyk, Avner Magen, Anastasios Sidiropoulos,...