Near Isometric Terminal Embeddings for Doubling Metrics
February 22, 2018 Β· Declared Dead Β· π Algorithmica
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Michael Elkin, Ofer Neiman
arXiv ID
1802.07967
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.CG
Citations
4
Venue
Algorithmica
Last Checked
4 months ago
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+Ξ΅$ for some small $0<Ξ΅<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+Ξ΅$ and size $s(|X|)$ has its terminal counterpart, with distortion $1+O(Ξ΅)$ and size $s(|K|)+1$. In particular, for any doubling metric on $n$ points, a set of $k=o(n)$ terminals, and constant $0<Ξ΅<1$, there exists: (1) A spanner with stretch $1+Ξ΅$ for pairs in $K\times X$, with $n+o(n)$ edges. (2) A labeling scheme with stretch $1+Ξ΅$ for pairs in $K\times X$, with label size $\approx \log k$. (3) An embedding into $\ell_\infty^d$ with distortion $1+Ξ΅$ 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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
π
π
The Cartographer
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted