New $(Ξ±,Ξ²)$ Spanners and Hopsets
July 26, 2019 Β· Declared Dead Β· π ACM-SIAM Symposium on Discrete Algorithms
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Uri Ben-Levy, Merav Parter
arXiv ID
1907.11402
Category
cs.DS: Data Structures & Algorithms
Citations
0
Venue
ACM-SIAM Symposium on Discrete Algorithms
Last Checked
5 months ago
Abstract
An $f(d)$-spanner of an unweighted $n$-vertex graph $G=(V,E)$ is a subgraph $H$ satisfying that $dist_H(u, v)$ is at most $f(dist_G(u, v))$ for every $u,v \in V$. We present new spanner constructions that achieve a nearly optimal stretch of $O(\lceil k /d \rceil)$ for any distance value $d \in [1,k^{1-o(1)}]$, and $d \geq k^{1+o(1)}$. We show the following: 1. There exists an $f(d)$-spanner $H \subseteq G$ with $f(d)\leq 7k$ for any $d \in [1,\sqrt{k}/2]$ with expected size $O_{k}(n^{1+1/k})$. This in particular gives $(Ξ±,Ξ²)$ spanners with $Ξ±=O(\sqrt{k})$ and $Ξ²=O(k)$. 2. For any $Ξ΅\in (0,1/2]$, there exists an $(Ξ±,Ξ²)$-spanner with $Ξ±=O(k^Ξ΅)$, $Ξ²=O_Ξ΅(k)$ and of expected size $O_{k}(n^{1+1/k})$. This implies a stretch of $O(\lceil k/d \rceil)$ for any $d \in [\sqrt{k}/2, k^{1-Ξ΅}]$, and for every $d\geq k^{1+Ξ΅}$. In particular, it provides a constant stretch already for vertex pairs at distance $k^{1+o(1)}$ (improving upon $d=(\log k)^{\log k}$ that was known before). Up to the $o(1)$ factor in the exponent, and the constant factor in the stretch, this is the best possible by the girth argument. 3. For any $Ξ΅\in (0,1)$ and integer $k\geq 1$, there is a $(3+Ξ΅, Ξ²)$-spanner with $Ξ²=O_Ξ΅(k^{\log(3+8/Ξ΅)})$ and $O_{k,Ξ΅}(n^{1+1/k})$ edges. We also consider the related graph concept of hopsets introduced by [Cohen, J. ACM '00]. We present a new family of $(Ξ±,Ξ²)$ hopsets with $\widetilde{O}(k \cdot n^{1+1/k})$ edges and $Ξ±\cdot Ξ²=O(k)$. Most notably, we show a construction of $(3+Ξ΅,Ξ²)$ hopset with $\widetilde{O}_{k,Ξ΅}(n^{1+1/k})$ edges and hop-bound of $Ξ²=O_Ξ΅(k^{\log(3+9/Ξ΅)})$, improving upon the state-of-the-art hop-bound of $Ξ²=O(\log k /Ξ΅)^{\log k}$ by [Elkin-Neiman, '17] and [Huang-Pettie, '17].
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