28 search results - page 6 / 6 » On Spanners and Lightweight Spanners of Geometric Graphs |
145
click to vote
PODC
2006
ACM
15 years 12 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
211
click to vote
WADS
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
149
click to vote
DCOSS
2005
Springer
15 years 11 months ago
2005
Springer
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...