Published on *Computer Science Department at Princeton University* (http://www.cs.princeton.edu)

Given a graph G, a subgraph G' is a t-spanner of G, if for every u,v that is an element of V, the distance from u to v in G' is at most t times longer than the distance in G. In this paper we give a very simple algorithm for constructing sparse spanners for arbitrary weighted graphs. We then apply this algorithm to obtain specific results for planar graphs and Euclidean graphs. We discuss the optimality of our results and present several nearly matching lower bounds.

**Links**

[1] http://www.cs.princeton.edu/research/techreps/author/649

[2] http://www.cs.princeton.edu/research/techreps/author/663

[3] http://www.cs.princeton.edu/research/techreps/author/375

[4] http://www.cs.princeton.edu/research/techreps/author/686

[5] ftp://ftp.cs.princeton.edu/techreports/1990/261.pdf