Metraipolis › archive › dc_72e7dd3b3fd2

Reading between the levels: new tools for the Thorup-Zwick hierarchy and their applications — arXiv:2611.01297

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01297
License (as archived)
CC0-1.0
Archived
2026-11-03T18:58:54.203Z
SHA-256 of the archived text
785b4a7a83ddeabdbd18aa2d93f285fd4bbbefb38dae98152256e15008674c1c
Stable URL of this page
https://metraipolis.com/documento/dc_72e7dd3b3fd2

How to cite

Reading between the levels: new tools for the Thorup-Zwick hierarchy and their applications — arXiv:2611.01297 — arXiv (en), https://arxiv.org/abs/2611.01297 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_72e7dd3b3fd2 (Metraipolis archive dc_72e7dd3b3fd2, sha256 785b4a7a83ddeabdbd18aa2d93f285fd4bbbefb38dae98152256e15008674c1c)
BibTeX
@misc{dc72e7dd3b3fd2,
  title = {Reading between the levels: new tools for the Thorup-Zwick hierarchy and their applications — arXiv:2611.01297},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01297},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_72e7dd3b3fd2; sha256 785b4a7a83ddeabdbd18aa2d93f285fd4bbbefb38dae98152256e15008674c1c},
  year = {2026}
}

Archived text

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

In this paper, we develop three new analytical tools for the Thorup-Zwick hierarchy: the Mixed-Level Growth, Two-Level Growth, and Long-Short Growth lemmas. Using these tools, we obtain improved approximate distance oracles (ADOs), and algorithms for $n$-pairs shortest paths ($n$-PSP), multiple-source shortest paths (MSSP), and $ST$-shortest paths, as well as new hopsets. One of our main results is a $(\frac 65 k+O(1))$-stretch ADO with $\tilde O(mn^{1/k})$ preprocessing time and space (where $\tilde O$ hides polylogarithmic factors), and $\tilde O(n^{1/k})$ query time, breaking, for sparse graphs, the $(2k-O(1))$-stretch barrier for ADOs with $\tilde O(n^{1+1/k})$ space and $\tilde O(n^{1/k})$ query time. In unweighted graphs, we also obtain a $(\frac 65 k+O(1),O(k))$-approximate ADO with $\tilde O(n^{1+1/k})$ space and $\tilde O(n^{1/k})$ query time. This also yields a $(\frac 65 k+O(1))$-approximation algorithm for $m$-pairs shortest paths ($m$-PSP) in $\tilde O(mn^{1/k})$ time, answering the question of Chechik, Hoch, and Lifshitz [SODA'25] of whether the $2k-O(1)$ barrier for $n$-PSP in $\tilde O(mn^{1/k})$ time can be broken. For unweighted graphs, we give a new analysis of the existing $\tilde O(mn^{1/k}+n^{1+2/k})$-time $n$-PSP algorithm of [Chechik et al., SODA'25], and show that, without any modification, it is a $(k,k-1)$-approximation, i.e., $d(u,v)\le\hat d(u,v)\le k\cdot d(u,v)+k-1$ for every queried pair. This improves its multiplicative factor from $\frac 43 k+O(1)$ to $k$, and the leading coefficient $k$ is tight for this algorithm. Moreover, for graphs with $m=\Omega(n^{1+1/k})$, this answers the question of Dalirrooyfard et al. [FOCS'22] up to the additive $k-1$.

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.01297 — 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-03T18:18:07.713Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).