3 search results - page 1 / 1 » Computing the Greedy Spanner in Near-Quadratic Time |
106
Voted
ALGORITHMICA
2010
15 years 1 months ago
2010
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
104
Voted
SIAMCOMP
2002
15 years 21 days ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
126
Voted
MOBIHOC
2001
ACM
16 years 19 days ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...