7 search results - page 1 / 2 » Additive Spanners in Nearly Quadratic Time |
72
Voted
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
ALGORITHMICA
2010
14 years 9 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...
WDAG
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
SIAMCOMP
1998
14 years 9 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
ICRA
2008
IEEE
15 years 3 months ago
2008
IEEE
— Compliance in robot mounted force/torque sensors is useful for soft mating of parts. However it generates nearly undamped oscillations when moving the end-effector in free spac...