On additive spanners in weighted graphs with local error
Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen Kobourov, and Richard, Spence

TL;DR
This paper introduces new weighted additive spanners with local error bounds, improving sparsity and lightness guarantees over previous global-error constructions, applicable to pairwise and all-pairs distances.
Contribution
It presents the first weighted additive spanners with local error bounds, achieving improved sparsity and lightness guarantees in weighted graphs.
Findings
Pairwise +$(2+\varepsilon)W$ and +$(6+\varepsilon)W$ spanners with $O(n|\mathcal{P}|^{1/3})$ and $O(n|\mathcal{P}|^{1/4})$ edges.
All-pairs +$4W$ spanner with $\tilde{O}(n^{7/5})$ edges.
Lightness guarantees: $O(n)$ for +$\varepsilon W$ and $O(n^{2/3})$ for +$(4+\varepsilon)W$ spanners.
Abstract
An \emph{additive spanner} of a graph is a subgraph which preserves distances up to an additive error. Additive spanners are well-studied in unweighted graphs but have only recently received attention in weighted graphs [Elkin et al.\ 2019 and 2020, Ahmed et al.\ 2020]. This paper makes two new contributions to the theory of weighted additive spanners. For weighted graphs, [Ahmed et al.\ 2020] provided constructions of sparse spanners with \emph{global} error , where is the maximum edge weight in and is constant. We improve these to \emph{local} error by giving spanners with additive error for each vertex pair , where is the maximum edge weight along the shortest -- path in . These include pairwise and spanners over vertex pairs $\Pc \subseteq V…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
