An α-additive spanner of an undirected graph G=(V, E) is a subgraph H such that the distance between any two vertices in G is stretched by no more than an additive factor of α. It is previously known that unweighted graphs have 2-, 4-, and 6-additive spanners containing O(n^3/2), O(n^7/5), and O(n^4/3) edges, respectively. In this paper, we generalize these results to weighted graphs. We consider α=2W, 4W, 6W, where W is the maximum edge weight in G. We first show that every n-node graph has a subsetwise 2W-spanner on O(n |S|^1/2) edges where S ⊆ V and W is a constant. We then show that for every set P with |P| = p vertex demand pairs, there are pairwise 2W- and 4W-spanners on O(np^1/3) and O(np^2/7) edges respectively. We also show that for every set P, there is a 6W-spanner on O(np^1/4) edges where W is a constant. We then show that every graph has additive 2W- and 4W-spanners on O(n^3/2) and O(n^7/5) edges respectively. Finally, we show that every graph has an additive 6W-spanner on O(n^4/3) edges where W is a constant.

• 18 publications
• 24 publications
• 11 publications
• 51 publications
• 11 publications
research
03/17/2021

### On additive spanners in weighted graphs with local error

An additive +β spanner of a graph G is a subgraph which preserves distan...
research
03/04/2019

### An FPT Algorithm for Minimum Additive Spanner Problem

For a positive integer t and a graph G, an additive t-spanner of G is a ...
research
03/22/2023

Given an undirected unweighted graph G = (V, E) on n vertices and m edge...
research
05/04/2019

### New Notions and Constructions of Sparsification for Graphs and Hypergraphs

A sparsifier of a graph G (Benczúr and Karger; Spielman and Teng) is a s...
research
03/06/2023

### The Complexity of Geodesic Spanners

A geometric t-spanner for a set S of n point sites is an edge-weighted g...
research
09/14/2017

### Embedded-Graph Theory

In this paper, we propose a new type of graph, denoted as "embedded-grap...
research
01/21/2020

### Near-Additive Spanners and Near-Exact Hopsets, A Unified View

Given an unweighted undirected graph G = (V,E), and a pair of parameter...