Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Near Isometric Terminal Embeddings for Doubling Metrics (1802.07967v1)

Published 22 Feb 2018 in cs.DS and cs.CG

Abstract: Given a metric space $(X,d)$, a set of terminals $K\subseteq X$, and a parameter $t\ge 1$, we consider metric structures (e.g., spanners, distance oracles, embedding into normed spaces) that preserve distances for all pairs in $K\times X$ up to a factor of $t$, 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+\epsilon$ for some small $0<\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+\epsilon$ and size $s(|X|)$ has its terminal counterpart, with distortion $1+O(\epsilon)$ and size $s(|K|)+1$. In particular, for any doubling metric on $n$ points, a set of $k=o(n)$ terminals, and constant $0<\epsilon<1$, there exists: (1) A spanner with stretch $1+\epsilon$ for pairs in $K\times X$, with $n+o(n)$ edges. (2) A labeling scheme with stretch $1+\epsilon$ for pairs in $K\times X$, with label size $\approx \log k$. (3) An embedding into $\ell_\inftyd$ with distortion $1+\epsilon$ for pairs in $K\times X$, where $d=O(\log k)$. Moreover, surprisingly, the last two results apply if only $K$ is a doubling metric, while $X$ can be arbitrary.

Citations (4)

Summary

We haven't generated a summary for this paper yet.