31 search results - page 1 / 7 » An Optimal Dynamic Spanner for Doubling Metric Spaces |
ESA
2008
Springer
13 years 7 months ago
2008
Springer
ALGORITHMICA
2010
13 years 5 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...
BIRTHDAY
2009
Springer
14 years 4 days ago
2009
Springer
We introduce the weak gap property for directed graphs whose vertex set S is a metric space of size n. We prove that, if the doubling dimension of S is a constant, any directed gra...
ESA
2009
Springer
13 years 10 months ago
2009
Springer
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
ALGORITHMICA
2002
13 years 5 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...