Sunil Arya, Michiel Smid  Home/Search
Context Related
| cs.ust.hk/faculty/arya/pub...degspan.ps mpisb.mpg.de/pub/...MPII94115.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.ust.hk/faculty/arya/bio (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Let S be a set of n points in IR d and let t ? 1 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 efficient 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(log n) times the length of a minimum spanning tree for... (Update)
Similar documents based on text: More All
0.9: Randomized and Deterministic Algorithms for Geometric.. - Arya, Mount, Smid (1994) (Correct)
0.5: Geometric Spanners for Wireless Ad Hoc Networks - Alzoubi, Li, Wang, Wan, Frieder (2003) (Correct)
0.4: Dynamic algorithms for geometric spanners of small diameter.. - Arya, Mount (1994) (Correct)
BibTeX entry: (Update)
S. Arya and M. Smid, Efficient construction of a bounded degree spanner with low weight, ESA'94, LNCS 855, 1994, pp.48-59. http://citeseer.ist.psu.edu/arya95efficient.html More
@techreport{ arya94efficient,
author = "Sunil Arya and Michiel Smid",
title = "Efficient Construction of a Bounded Degree Spanner with Low Weight",
number = "MPI-I-94-115",
address = "Saarbr{\"u}cken",
year = "1994",
url = "citeseer.ist.psu.edu/arya95efficient.html" }
Citations (may not include all citations):508 Computational Geometry (context) - Preparata, Shamos - 1985
74 On constructing minimum spanning trees in k-dimensional spac.. (context) - Yao - 1982
49 Euclidean spanners: short (context) - Arya, Das et al. - 1995
49 Dynamic fractional cascading (context) - Mehlhorn, Naher - 1990
45 New sparseness results on graph spanners - Chandra, Das et al. - 1992
44 Static and dynamic algorithms for k-point clustering problem.. (context) - Datta, Lenhof et al. - 1993
28 A fast algorithm for constructing sparse Euclidean spanners (context) - Das, Narasimhan - 1994
24 A sparse graph almost as good as the complete graph on point.. (context) - Vaidya - 1991
24 Constructing multidimensional spanner graphs (context) - Salowe - 1991
22 Simple algorithms for enumerating interpoint distances and f.. (context) - Dickerson, Drysdale et al. - 1992
13 Maintaining the minimal distance of a point set in polylogar.. (context) - Smid - 1992
11 Enumerating interdistances in space (context) - Salowe - 1992
11 A new way to weigh malnourished Euclidean graphs (context) - Das, Narasimhan et al. - 1995
10 Constructing degree-3 spanners with other sparseness propert.. (context) - Das, Heffernan - 1993
8 Optimally sparse spanners in 3dimensional Euclidean space (context) - Das, Heffernan et al. - 1993
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ust.hk/faculty/arya/bio.html): More
On the Expected Depth of Random Circuits - Arya, Golin, Mehlhorn (1998) (Correct)
An Optimal Algorithm for Approximate Nearest.. - Arya, Mount.. (1994) (Correct)
Approximate Range Searching - Sunil Arya (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC