Abstract
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.
Partially supported by EU ESPRIT Long Term Research Project 20244 (ALCOM-IT) and DFG Graduiertenkolleg “Parallele Rechnernetzwerke in der Produktionstechnik” Me872/4-1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
M. Ben-Or. Lower bouns for algebraic computation trees. In 15th ACM Symposium on Theory of Computing (STOC’83), pages 80–86, 1983.
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.
P. B. Callahan and S. R. Kosaraju. A decompostion of multidimensional point sets with applications to k-nearest neighbors and n-body potential fields. Journal of the ACM, 42:67–90, 1995.
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.
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.
K. L. Clarkson. Approximation algorithms for shortest path motion planning. In 19th ACM Symposium on Theory of Computing (STOC’87), pages 56–65, 1987.
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.
J. G. Hocking and G. S. Young. Topology. Addison-Wesley, 1961.
J. M. Keil. Approximating the complete Euclidean graph. In 1st ScandinavianWorkshop on Algorithm Theory (SWAT’88), pages 208–213, 1988.
J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry, 7:13–28, 1992.
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.
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.
J. S. Salowe. Constructing multidimensional spanner graphs. International Journal of Computational Geometry & Applications, 1:99–107, 1991.
P. M. Vaidya. A sparse graph almost as good as the complete graph on points in k dimensions. Discrete & Computational Geometry, 6:369–381, 1991.
A. C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11:721–736, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lukovszki, T. (1999). New Results on Fault Tolerant Geometric Spanners. In: Dehne, F., Sack, JR., Gupta, A., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1999. Lecture Notes in Computer Science, vol 1663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48447-7_20
Download citation
DOI: https://doi.org/10.1007/3-540-48447-7_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66279-2
Online ISBN: 978-3-540-48447-9
eBook Packages: Springer Book Archive