The Emergence of Sparse Spanners and Greedy Well-Separated Pair Decomposition

Abstract

A spanner graph on a set of points in R d contains a shortest path between any pair of points with length at most a constant factor of their Euclidean distance. A spanner with a sparse set of edges is thus a good candidate for network backbones, as desired in many practical scenarios such as the transportation network and peer-to-peer network overlays. In this paper we investigate new models and aim to interpret why good spanners 'emerge' in reality, when they are clearly built in pieces by agents with their own interests and the construction is not coordinated. Our main result is to show that the following algorithm generates a (1 + ε)-spanner with a linear number of edges, constant average degree, and the total edge length as a small logarithmic factor of the cost of the minimum spanning tree. In our algorithm, the points build edges at an arbitrary order. When a point p checks on whether the edge to a point q should be built, it will build this edge only if there is no existing edge p ′ q ′ with p ′ and q ′ at distances no more than 1 4(1+1/ε) · |p ′ q ′ | from p, q respectively. Eventually when all points have finished checking edges to all other points, the resulted collection of edges forms a sparse spanner as desired. This new spanner construction algorithm can be extended to a metric space with constant doubling dimension and admits a local routing scheme to find the short paths.As a side product, we show a greedy algorithm for constructing linear-size well-separated pair decompositions that may be of interest on its own. A well-separated pair decomposition is a collection of subset pairs such that each pair of point sets is fairly far away from each other compared with their diameters and that every pair of points is 'covered' by at least one well-separated pair. Our greedy algorithm selects an arbitrary pair of points that have not yet been covered and puts a 'dumb-bell' around the pair as the well-separated pair, repeats this until all pairs of points are covered. When the algorithm finishes, we show only a linear number of pairs is generated, which is asymptotically optimal.

Diameter Spanners, Eccentricity Spanners, and Approximating Extremal Distances

“…Nevertheless, such a sparsification of graphs indeed suffices for many of the original applications of the well-studied standard graph spanners, such as in communication networks, facility location problem, routing, etc. In particular, diameter spanners with a sparse set of edges are good candidates for backbone networks [32]. Our study of extremal-distance spanners has many additional implications that we present in the next subsection.…”

“…The notion of spanners (also known as distance spanner) was first introduced and studied in [7,23,37]. A spanner (also known as distance spanner) of a graph G = (V, E) is a sparse subgraph H = (V, E H ) that approximately preserves pair-wise distances of the underlying graph G. Besides being theoretically interesting, they are known to have numerous applications in different areas of computer science such as distributed systems, communication networks and efficient routing schemes [21,22,38,39,42,33,4,32], motion planning [25,20], approximating shortest paths [18,19,26] and distance oracles [12,43].…”