Online Euclidean Spanners

In this article, we study the online Euclidean spanners problem for points in \ (R^d\). Given a set \ (S\) of \ (n\) points in \ (R^d\), a \ (t\) -spanner on \ (S\) is a subgraph of the underlying complete graph \ (G= (S, S2) \), that preserves the pairwise Euclidean distances between points in \ (S\) to within a factor of \ (t\), that is the stretch factor. Suppose we are given a sequence of \ (n\) points \ ( (s₁, s₂, , s₍) \) in \ (R^d\), where point \ (s₈\) is presented in step \ (i\) for \ (i=1, , n\). The objective of an online algorithm is to maintain a geometric \ (t\) -spanner on \ (S₈=\s₁, , s₈\\) for each step \ (i\). The algorithm is allowed to add new edges to the spanner when a new point is presented but cannot remove any edge from the spanner. The performance of an online algorithm is measured by its competitive ratio, which is the supremum, over all sequences of points, of the ratio between the weight of the spanner constructed by the algorithm and the weight of an optimum spanner. Here, the weight of a spanner is the sum of all edge weights. First, we establish a lower bound of \ ( (^-1 n/^-1) \) for the competitive ratio of any online \ ( (1+) \) -spanner algorithm, for a sequence of \ (n\) points in 1-dimension. We show that this bound is tight, and there is an online algorithm that can maintain a \ ( (1+) \) -spanner with competitive ratio \ (O (^-1 n/^-1) \). Next, we design online algorithms for sequences of points in \ (R^d\), for any constant \ (d 2\), under the \ (L₂\) norm. We show that previously known incremental algorithms achieve a competitive ratio \ (O (^- (d+1) n) \). However, if the algorithm is allowed to use additional points (Steiner points), then it is possible to substantially improve the competitive ratio in terms of \ (\). We describe an online Steiner \ ( (1+) \) -spanner algorithm with competitive ratio \ (O (^ (1-d) /2 n) \). As a counterpart, we show that the dependence on \ (n\) cannot be eliminated in dimensions \ (d 2\). In particular, we prove that any online spanner algorithm for a sequence of \ (n\) points in \ (R^d\) under the \ (L₂\) norm has competitive ratio \ ( (f (n) ) \), where \ (₍f (n) =\). Finally, we provide improved lower bounds under the \ (L₁\) norm: \ ( (^-2/^-1) \) in the plane and \ ( (^-d) \) in \ (R^d\) for \ (d 3\).