Sciweavers

30 search results - page 1 / 6
» Spanners of Additively Weighted Point Sets
Sort
View
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 5 months ago
Spanners of Additively Weighted Point Sets
Prosenjit Bose, Paz Carmi, Mathieu Couture
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
13 years 10 months ago
Geometric Spanners for Weighted Point Sets
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...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
13 years 5 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
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...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
14 years 6 months ago
Fault-tolerant spanners for general graphs
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 ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...
ESA
1994
Springer
138views Algorithms» more  ESA 1994»
13 years 9 months ago
Efficient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
Sunil Arya, Michiel H. M. Smid