Finding 4-Additive Spanners: Faster, Stronger, and Simpler

Abstract

Additive spanners are fundamental graph structures with wide applications in network design, graph sparsification, and distance approximation. In particular, a $4$-additive spanner is a subgraph that preserves all pairwise distances up to an additive error of $4$. In this paper, we present a new deterministic algorithm for constructing $4$-additive spanners that matches the best known edge bound of $\tilde{O}(n^{7/5})$ (up to polylogarithmic factors), while improving the running time to $\tilde{O}(\min \{m{n}^{3/5},n^{11/5}\})$, compared to the previous $\tilde{O}(m{n}^{3/5})$ randomized construction. Our algorithm is not only faster in the dense regime but also fully deterministic, conceptually simpler, and easier to implement and analyze.