English

Near Isometric Terminal Embeddings for Doubling Metrics

Data Structures and Algorithms 2018-02-23 v1 Computational Geometry

Abstract

Given a metric space (X,d)(X,d), a set of terminals KXK\subseteq X, and a parameter t1t\ge 1, we consider metric structures (e.g., spanners, distance oracles, embedding into normed spaces) that preserve distances for all pairs in K×XK\times X up to a factor of tt, and have small size (e.g. number of edges for spanners, dimension for embeddings). While such terminal (aka source-wise) metric structures are known to exist in several settings, no terminal spanner or embedding with distortion close to 1, i.e., t=1+ϵt=1+\epsilon for some small 0<ϵ<10<\epsilon<1, is currently known. Here we devise such terminal metric structures for {\em doubling} metrics, and show that essentially any metric structure with distortion 1+ϵ1+\epsilon and size s(X)s(|X|) has its terminal counterpart, with distortion 1+O(ϵ)1+O(\epsilon) and size s(K)+1s(|K|)+1. In particular, for any doubling metric on nn points, a set of k=o(n)k=o(n) terminals, and constant 0<ϵ<10<\epsilon<1, there exists: (1) A spanner with stretch 1+ϵ1+\epsilon for pairs in K×XK\times X, with n+o(n)n+o(n) edges. (2) A labeling scheme with stretch 1+ϵ1+\epsilon for pairs in K×XK\times X, with label size logk\approx \log k. (3) An embedding into d\ell_\infty^d with distortion 1+ϵ1+\epsilon for pairs in K×XK\times X, where d=O(logk)d=O(\log k). Moreover, surprisingly, the last two results apply if only KK is a doubling metric, while XX can be arbitrary.

Keywords

Cite

@article{arxiv.1802.07967,
  title  = {Near Isometric Terminal Embeddings for Doubling Metrics},
  author = {Michael Elkin and Ofer Neiman},
  journal= {arXiv preprint arXiv:1802.07967},
  year   = {2018}
}