TY - JOUR
T1 - Light Spanners for High Dimensional Norms via Stochastic Decompositions
AU - Filtser, Arnold
AU - Neiman, Ofer
N1 - Funding Information:
We would like to thank an anonymous reviewer for useful comments.
Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2022/10/1
Y1 - 2022/10/1
N2 - 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 O~(n1+1/t2) 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 ℓp with 1 < p≤ 2. Second, our construction yields a spanner which is both sparse and also 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 ℓp for 1 < p≤ 2 has an O(t)-spanner with n1+O~(1/tp) edges and lightness nO~(1/tp). 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(n1/t). We exhibit the following tradeoff: metrics with decomposability parameter ν= ν(t) admit an O(t)-spanner with lightness O~ (ν1/t). For example, metrics with doubling constant λ, graphs of genus g, and graphs of treewidth k, all have spanners with stretch O(t) and lightness O~ (λ1/t) , O~ (g1/t) , O~ (k1/t) respectively. While these families do admit a (1 + ϵ)-spanner, its lightness depend exponentially on the dimension (resp. log g, k). Our construction alleviates this exponential dependency, at the cost of incurring larger stretch.
AB - 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 O~(n1+1/t2) 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 ℓp with 1 < p≤ 2. Second, our construction yields a spanner which is both sparse and also 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 ℓp for 1 < p≤ 2 has an O(t)-spanner with n1+O~(1/tp) edges and lightness nO~(1/tp). 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(n1/t). We exhibit the following tradeoff: metrics with decomposability parameter ν= ν(t) admit an O(t)-spanner with lightness O~ (ν1/t). For example, metrics with doubling constant λ, graphs of genus g, and graphs of treewidth k, all have spanners with stretch O(t) and lightness O~ (λ1/t) , O~ (g1/t) , O~ (k1/t) respectively. While these families do admit a (1 + ϵ)-spanner, its lightness depend exponentially on the dimension (resp. log g, k). Our construction alleviates this exponential dependency, at the cost of incurring larger stretch.
KW - Doubling dimension
KW - Genus graphs
KW - High dimensional euclidean space
KW - Spanners
KW - Stochastic decompositions
KW - Treewidth
UR - http://www.scopus.com/inward/record.url?scp=85132964201&partnerID=8YFLogxK
U2 - 10.1007/s00453-022-00994-0
DO - 10.1007/s00453-022-00994-0
M3 - Article
AN - SCOPUS:85132964201
SN - 0178-4617
VL - 84
SP - 2987
EP - 3007
JO - Algorithmica
JF - Algorithmica
IS - 10
ER -