Metraipolis › archive › dc_f61520b2f820

Towards Lower Bounds for Geometric Spanners in High Dimension — arXiv:2608.08706

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.08706
License (as archived)
CC0-1.0
Archived
2026-10-19T09:16:43.092Z
SHA-256 of the archived text
0cadc2257c36bbfacd0b95323811c3d7dce47466545074d738f95a55fe411c1e
Stable URL of this page
https://metraipolis.com/documento/dc_f61520b2f820

How to cite

Towards Lower Bounds for Geometric Spanners in High Dimension — arXiv:2608.08706 — arXiv (en), https://arxiv.org/abs/2608.08706 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f61520b2f820 (Metraipolis archive dc_f61520b2f820, sha256 0cadc2257c36bbfacd0b95323811c3d7dce47466545074d738f95a55fe411c1e)
BibTeX
@misc{dcf61520b2f820,
  title = {Towards Lower Bounds for Geometric Spanners in High Dimension — arXiv:2608.08706},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.08706},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f61520b2f820; sha256 0cadc2257c36bbfacd0b95323811c3d7dce47466545074d738f95a55fe411c1e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08706. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study the stretch--size tradeoff for geometric spanners in high-dimensional $\ell_p$ spaces. Our main contribution is a simple proof of a lower bound shown by Har-Peled, Indyk, and Sidiropoulos [SODA 2013]: Every $2$-hop $t$-spanner of the pointset $\{0,1\}^d$ under $\ell_2$ norm has at least $(2^d)^{1+\Omega(1/t^2)}$ edges. Our proof further extends this result to spanners with Steiner vertices. In addition, we establish a connection between bounded-hop spanners and general spanners, as follows. If every subset $Y$ of an $n$-point metric has a $t$-spanner with at most $\mu|Y|$ edges, then the metric has an $O(t)$-hop $O(t)$-spanner of size $O(n(\mu+\log n))$. Consequently, hop-restricted spanner lower bounds for a metric imply lower bounds without hop restriction for one of its subsets.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in cs.DS).
Categorie arXiv: Computational Geometry (cs.CG) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.08706 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:13:57.848Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).