On Additive Spanners in Weighted Graphs with Local Error

An \emph{additive $+\beta$ spanner} of a graph $G$ is a subgraph which preserves distances up to an additive $+\beta$ 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 $\beta = cW$, where $W$ is the maximum edge weight in $G$ and $c$ is constant. We improve these to \emph{local} error by giving spanners with additive error $+cW(s,t)$ for each vertex pair $(s,t)$, where $W(s, t)$ is the maximum edge weight along the shortest $s$--$t$ path in $G$. These include pairwise $+(2+\eps)W(\cdot,\cdot)$ and $+(6+\eps) W(\cdot, \cdot)$ spanners over vertex pairs $\Pc \subseteq V \times V$ on $O_{\eps}(n|\Pc|^{1/3})$ and $O_{\eps}(n|\Pc|^{1/4})$ edges for all $\eps>0$, which extend previously known unweighted results up to $\eps$ dependence, as well as an all-pairs $+4W(\cdot,\cdot)$ spanner on $\widetilde{O}(n^{7/5})$ edges. Besides sparsity, another natural way to measure the quality of a spanner in weighted graphs is by its \emph{lightness}, defined as the total edge weight of the spanner divided by the weight of an MST of $G$. We provide a $+\eps W(\cdot,\cdot)$ spanner with $O_{\eps}(n)$ lightness, and a $+(4+\eps) W(\cdot,\cdot)$ spanner with $O_{\eps}(n^{2/3})$ lightness. These are the first known additive spanners with nontrivial lightness guarantees. All of the above spanners can be constructed in polynomial time.

[1]  David P. Dobkin,et al.  Generating Sparse Spanners for Weighted Graphs , 1990, SWAT.

[2]  Oren Salzman,et al.  Sparsification of motion-planning roadmaps by edge contraction , 2014, Int. J. Robotics Res..

[3]  Telikepalli Kavitha New Pairwise Spanners , 2016, Theory of Computing Systems.

[4]  David Peleg,et al.  (1+epsilon, beta)-Spanner Constructions for General Graphs , 2004, SIAM J. Comput..

[5]  Ami Paz,et al.  Distributed Construction of Purely Additive Spanners , 2016, DISC.

[6]  Uri Zwick,et al.  All-Pairs Almost Shortest Paths , 1997, SIAM J. Comput..

[7]  Shiri Chechik,et al.  New Additive Spanners , 2013, SODA.

[8]  Christian Wulff-Nilsen,et al.  Near-Optimal Light Spanners , 2016, SODA.

[9]  Kostas E. Bekris,et al.  Asymptotically Near-Optimal Planning With Probabilistic Roadmap Spanners , 2013, IEEE Transactions on Robotics.

[10]  Giri Narasimhan,et al.  New sparseness results on graph spanners , 1992, SCG '92.

[11]  Eli Upfal,et al.  A trade-off between space and efficiency for routing tables , 1989, JACM.

[12]  Telikepalli Kavitha,et al.  Small Stretch Pairwise Spanners and Approximate D-Preservers , 2015, SIAM J. Discret. Math..

[13]  Stephen G. Kobourov,et al.  Graph Spanners: A Tutorial Review , 2020, Comput. Sci. Rev..

[14]  Greg Bodwin A Note on Distance-Preserving Graph Sparsification , 2020 .

[15]  Samir Khuller,et al.  Balancing minimum spanning and shortest path trees , 1993, SODA '93.

[16]  Alejandro A. Schäffer,et al.  Graph spanners , 1989, J. Graph Theory.

[17]  David P. Woodruff Additive Spanners in Nearly Quadratic Time , 2010, ICALP.

[18]  Mathias Bæk Tejs Knudsen,et al.  Additive Spanners: A Simple Construction , 2014, SWAT.

[19]  Michael Elkin,et al.  Light Spanners , 2014, ICALP.

[20]  Kostas E. Bekris,et al.  Sparse roadmap spanners for asymptotically near-optimal motion planning , 2014, Int. J. Robotics Res..

[21]  Piotr Indyk,et al.  Fast estimation of diameter and shortest paths (without matrix multiplication) , 1996, SODA '96.

[22]  Abu Reyan Ahmed,et al.  Weighted Additive Spanners , 2020, WG.

[23]  Leizhen Cai,et al.  Computing Visibility Information in an Inaccurate Simple Polygon , 1997, Int. J. Comput. Geom. Appl..

[24]  Shay Solomon,et al.  The Greedy Spanner is Existentially Optimal , 2016, PODC.