This survey provides a guiding reference to researchers seeking an overview of the large
body of literature about graph spanners. It surveys the current literature covering various …

We present online algorithms for directed spanners and Steiner forests. These problems fall
under the unifying framework of online covering linear programming formulations …

Abstract Guha et al.[STOC, 1999] and Moss and Rabani [SIAM J. Comput., 2007] introduced
two variants of the Steiner problem in undirected graphs in which the nodes are associated …

For a given graph $ G $, a" hopset" $ H $ with hopbound $\beta $ and stretch $\alpha $ is a
set of edges such that between every pair of vertices $ u $ and $ v $, there is a path with at …

We start by slightly modifying the generic framework for solving online covering and packing
linear programs (LP) proposed in the seminal work of Buchbinder and Naor (Mathematics of …

Given a graph $ G $, a\emph {graph spanner}(or simply\emph {spanner}) is a subgraph that
preserves lengths of shortest paths in $ G $ up to some amount of distortion or error, typically …