52 search results - page 1 / 11 » Geometric Spanners for Weighted Point Sets |
ESA
2009
Springer
13 years 9 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...
SIAMCOMP
2002
13 years 4 months 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...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The construction of t-spanners of a given point set has received a lot of attention, especially from a theoretical perspective. In this paper we perform the first extens...
COMPGEOM
2009
ACM
13 years 9 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...