A Simple and Linear Time Randomized Algorithm for Computing Sparse Spanners in Weighted Graphs

Let G = (V, E) be an undirected weighted graph on |V | = n vertices, and |E| = m edges. A t-spanner of the graph G, for any t 1, is a subgraph (V, ES), ES E, such that the distance between any pair of vertices in the subgraph is at most t times the distance between them in the graph G. Computing a t-spanner of minimum size (number of edges) has b..