Efficient Construction of a Bounded Degree Spanner with Low Weight

@inproceedings{Arya1994EfficientCO,
  title={Efficient Construction of a Bounded Degree Spanner with Low Weight},
  author={Sunil Arya and Michiel H. M. Smid},
  booktitle={ESA},
  year={1994}
}
Let S be a set of n points in IR and let t be a real number A t spanner for S is a graph having the points of S as its vertices such that for any pair p q of points there is a path between them of length at most t times the Euclidean distance between p and q An e cient implementation of a greedy algorithm is given that constructs a t spanner having bounded degree such that the total length of all its edges is bounded by O logn times the length of a minimum spanning tree for S The algorithm has… CONTINUE READING
Highly Cited
This paper has 87 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 42 extracted citations

87 Citations

051015'94'99'05'11'17
Citations per Year
Semantic Scholar estimates that this publication has 87 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…