Light Spanners for High Dimensional Norms via Stochastic Decompositions
April 20, 2018 Β· Declared Dead Β· π Algorithmica
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Arnold Filtser, Ofer Neiman
arXiv ID
1804.07456
Category
cs.DS: Data Structures & Algorithms
Citations
20
Venue
Algorithmica
Last Checked
3 months ago
Abstract
Spanners for low dimensional spaces (e.g. Euclidean space of constant dimension, or doubling metrics) are well understood. This lies in contrast to the situation in high dimensional spaces, where except for the work of Har-Peled, Indyk and Sidiropoulos (SODA 2013), who showed that any $n$-point Euclidean metric has an $O(t)$-spanner with $\tilde{O}(n^{1+1/t^2})$ edges, little is known. In this paper we study several aspects of spanners in high dimensional normed spaces. First, we build spanners for finite subsets of $\ell_p$ with $1<p\le 2$. Second, our construction yields a spanner which is both sparse and also {\em light}, i.e., its total weight is not much larger than that of the minimum spanning tree. In particular, we show that any $n$-point subset of $\ell_p$ for $1<p\le 2$ has an $O(t)$-spanner with $n^{1+\tilde{O}(1/t^p)}$ edges and lightness $n^{\tilde{O}(1/t^p)}$. In fact, our results are more general, and they apply to any metric space admitting a certain low diameter stochastic decomposition. It is known that arbitrary metric spaces have an $O(t)$-spanner with lightness $O(n^{1/t})$. We exhibit the following tradeoff: metrics with decomposability parameter $Ξ½=Ξ½(t)$ admit an $O(t)$-spanner with lightness $\tilde{O}(Ξ½^{1/t})$. For example, $n$-point Euclidean metrics have $Ξ½\le n^{1/t}$, metrics with doubling constant $Ξ»$ have $Ξ½\leΞ»$, and graphs of genus $g$ have $Ξ½\le g$. While these families do admit a ($1+Ξ΅$)-spanner, its lightness depend exponentially on the dimension (resp. $\log g$). Our construction alleviates this exponential dependency, at the cost of incurring larger stretch.
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