Author(s)Indyk, Piotr; Magen, Avner; Sidiropoulos, Anastasios; Zouzias, Anastasios
MetadataShow full item record
We initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points X = x [subscript 1],...,x [subscript n] one by one, from a metric space M = (X,D). Our goal is to compute a low-distortion embedding of M into some host space, which has to be constructed in an on-line fashion, so that the image of each x i depends only on x [subscript 1],...,x [subscript i] . We prove several results translating existing embeddings to the on-line setting, for the case of embedding into ℓ [subscript p] spaces, and into distributions over ultrametrics.
13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Indyk, Piotr et al. “Online Embeddings.” Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Ed. Maria Serna et al. Vol. 6302. (Lecture Notes in Computer Science, 6302) Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. 246-259.
Author's final manuscript