Metraipolis › archive › dc_fcf14e6dec62

Improved Bounds on Distance Preservers — arXiv:2611.05878

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05878
License (as archived)
CC0-1.0
Archived
2026-11-05T18:31:34.122Z
SHA-256 of the archived text
b926d3d8a0ceaed26258fc75fa6a7c38ccd6187f479b735694a424dd8866edad
Stable URL of this page
https://metraipolis.com/documento/dc_fcf14e6dec62

How to cite

Improved Bounds on Distance Preservers — arXiv:2611.05878 — arXiv (en), https://arxiv.org/abs/2611.05878 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fcf14e6dec62 (Metraipolis archive dc_fcf14e6dec62, sha256 b926d3d8a0ceaed26258fc75fa6a7c38ccd6187f479b735694a424dd8866edad)
BibTeX
@misc{dcfcf14e6dec62,
  title = {Improved Bounds on Distance Preservers — arXiv:2611.05878},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05878},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fcf14e6dec62; sha256 b926d3d8a0ceaed26258fc75fa6a7c38ccd6187f479b735694a424dd8866edad},
  year = {2026}
}

Archived text

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

Given an undirected unweighted graph $G$ on $n$ vertices and a set $P$ of $p$ pairs of its vertices, a distance preserver is a sparse subgraph of $G$ that exactly preserves the shortest-path distances between all pairs in $P$. In this paper, we prove a new upper bound of $O(n^{8/9} p^{4/9})$ for distance preservers when $p\in [n^{1/2}, n]$. Our result improves the previous bound of $O\big(n^{2/3}p^{2/3}+np^{1/3}\big)$ by Bodwin and Vassilevska Williams and $O(\min\{n+n^{1/2}p,\,np^{1/2}\})$ by Coppersmith and Elkin, particularly in the regime $p\in [n^{7/10}, n]$, and narrows the gap toward the conjectured $O(n^{2/3}p^{2/3}+n)$ bound. Using the techniques developed for distance preservers, we are also able to obtain pairwise additive $+2$ spanners with $O(n+n^{9/10}p^{2/5})$ edges, pairwise additive $+4$ spanners with $O(n+n^{24/25}p^{8/25})$ edges, and new bounds for sourcewise spanners, improving upon previous results in certain parameter regimes.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.05878 — 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-11-05T18:21:04.024Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).