For a graph G, a D-diameter-reducing exact hopset is a small set of additional edges H that,
when added to G, maintains its graph metric but guarantees that all node pairs have a …

We study the well-known shortcut set problem: how much can one decrease the diameter of
a directed graph by adding a small set of shortcuts from the transitive closure of the graph …

For a given (possibly weighted) graph G=(V, E), an additive emulator H is a weighted graph
in V× V that preserves the (all pairs) G-distances up to a small additive stretch. In their …

In the semi-streaming model for processing massive graphs, an algorithm makes multiple
passes over the edges of a given n-vertex graph and is tasked with computing the solution to …

Given an undirected unweighted graph G=(V, E) on n vertices and m edges, a subgraph H⊆
G is a spanner of G with stretch function f: ℝ+→ ℝ+, iff for every pair s, t of vertices in V, dist H …

In the semi-streaming model for processing massive graphs, an algorithm makes multiple
passes over the edges of a given $ n $-vertex graph and is tasked with computing the …

We construct $ n $-node graphs on which any $ O (n) $-size spanner has additive error at
least $+\Omega (n^{3/17}) $, improving on the previous best lower bound of $\Omega …