30 search results - page 2 / 6 » Spanners of Additively Weighted Point Sets |
ESA
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. In a seminal STOC'95 paper, Arya et al. [4] devised a construction that for any set S of n points in Rd and any > 0, provides a (1 + )-spanner with diameter O(lo...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
SIAMCOMP
2002
13 years 5 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 11 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...
ESA
2009
Springer
14 years 1 days ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...