52 search results - page 2 / 11 » Geometric Spanners for Weighted Point Sets |
163
click to vote
ALGORITHMICA
2002
15 years 5 months ago
2002
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...
164
click to vote
FOCS
1994
IEEE
15 years 9 months ago
1994
IEEE
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 directed graph having the points of S as its vertices, such that for any pair p and q o...
181
click to vote
STACS
2007
Springer
16 years 3 days ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
172
click to vote
SODA
2007
ACM
15 years 7 months ago
2007
ACM
We introduce the concept of region-fault tolerant spanners for planar point sets, and prove the existence of region-fault tolerant spanners of small size. For a geometric graph G ...