New Results on Fault Tolerant Geometric Spanners
We investigate the problem of constructing spanners for a given set of points that are tolerant for edge/vertex faults. Let ℝ d be a set of n points and let k be an integer number. A k-edge/vertex fault tolerant spanner for S has the property that after the deletion of k arbitrary edges/vertices each pair of points in the remaining graph is still connected by a short path. Recently it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spannerwith O(k 2 n) edges which can be constructed in O(n log n + k 2 n) time. Furthermore, it was shown that for each set S of n points there exists a k-edge/vertex fault tolerant spannerwhose degree is bouned by O(c k+1) for some constant c.
Our first contribution is a construction of a k-vertex fault tolerant spanner with O(kn) edges which is a tight bound. The computation takes O(nlogd−1n + kn log log n) time. Then we show that the same k-vertex fault tolerant spanner is also k-edge fault tolerant. Thereafter, we construct a k-vertex fault tolerant spanner with O(k 2 n) edges whose degree is bounded by O(k 2). Finally, we give a more natural but stronger definition of k-edge fault tolerance which not necessarily can be satisfied if one allows only simple edges between the points of S. We investigate the question whether Steiner points help.We answer this question affirmatively and prove Θ(kn) bounds on the number of Steiner points and on the number of edges in such spanners.
KeywordsMinimum Span Tree Computational Geometry Real Constant Steiner Point Simplicial Cone
Unable to display preview. Download preview PDF.
- 1.S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: Short, thin, and lanky. In 27th ACM Symposium on Theory of Computing (STOC’95), pages 489–498, 1995.Google Scholar
- 2.S. Arya, D. M. Mount, and M. Smid. Randomized and deterministic algorithms for geometric spanners of small diameter. In 35th IEEE Symposium on Foundations of Computer Science (FOCS’94), pages 703–712, 1994.Google Scholar
- 3.M. Ben-Or. Lower bouns for algebraic computation trees. In 15th ACM Symposium on Theory of Computing (STOC’83), pages 80–86, 1983.Google Scholar
- 4.M. Smid C. Levcopoulos, G. Narasimhan. Efficient algorithms for constructing fault-tolerant geometric spanners. In 30th ACM Symposium on Theory of Computing (STOC’98), pages 186–195, 1998.Google Scholar
- 6.D. Z. Chen, G. Das, and M. Smid. Lower bounds for computing geometric spanners and approximate shortest paths. In 8th Canadian Conference on Computational Geometry (CCCG’ 96), pages 155–160, 1996.Google Scholar
- 7.L. P. Chew. There is a planar graph almost as good as the complete graph. In 2nd Annual ACM Symposium on Computational Geometry (SCG’86), pages 169–177, 1986.Google Scholar
- 8.K. L. Clarkson. Approximation algorithms for shortest path motion planning. In 19th ACM Symposium on Theory of Computing (STOC’87), pages 56–65, 1987.Google Scholar
- 9.M. Fischer, T. Lukovszki, and M. Ziegler. Geometric searching in walkthrough animations with weak spanners in real time. In 6th Annual European Symposium on Algorithms (ESA’98), pages 163–174, 1998.Google Scholar
- 10.J. G. Hocking and G. S. Young. Topology. Addison-Wesley, 1961.Google Scholar
- 11.J. M. Keil. Approximating the complete Euclidean graph. In 1st ScandinavianWorkshop on Algorithm Theory (SWAT’88), pages 208–213, 1988.Google Scholar
- 13.S. B. Rao and W. D. Smith. Improved approximation schemes for geometrical graphs via’ spanners’ and ‘banyans’. In 30th ACM Symposium on Theory of Computing (STOC’98), pages 540–550, 1998.Google Scholar
- 14.J. Ruppert and R. Seidel. Approximating the d-dimensional complete Euclidean graph. In 3rd Canadian Conference on Computational Geometry (CCCG’91), pages 207–210, 1991.Google Scholar