7 search results - page 1 / 2 » An Optimal Algorithm for Computing Angle-Constrained Spanner... |
ISAAC
2010
Springer
14 years 8 months ago
2010
Springer
ALGORITHMICA
2010
14 years 10 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...
DC
2010
14 years 10 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
STOC
2009
ACM
15 years 11 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 ...
STACS
2010
Springer
15 years 5 months ago
2010
Springer
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...