A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Gautam Das q t Giri NarasimhanÃ bstract Let G = (V, 1?) be a n-vertex connected graph with positive edge weights. A subgraph G' is a t-spanner if for all u, v c V, the distance between u and v in the subgraph is at most t times the corresponding distance in G. We design an O(n log2 n) time algorithm which, given a set V of n points in kdimensional space, and any constant t > 1, prduces a t-spanner of the complete Euclidean graph of V. This algorithm retains the spirit of a recent 0(n3 logdoi:10.1145/177424.177579 dblp:conf/compgeom/DasN94 fatcat:3ro5rv4nabadhhqtgvdkjekdci