New results on fault tolerant geometric spanners

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1663, Issue , 1999, Pages 193-204

  Lukovszki, Tamás ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

EDGE FAULT TOLERANCE; EDGE FAULTS; FAULT-TOLERANT; GEOMETRIC SPANNER; INTEGER NUMBERS; NEW RESULTS; STEINER POINTS; TIGHT BOUND;

FAULT TOLERANCE;

EID: 84948992294     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48447-7_20     Document Type: Conference Paper

References (17)

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.
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.
3. M. Ben-Or. Lower bouns for algebraic computation trees. In 15th ACM Symposium on Theory of Computing (STOC'83), pages 80-86, 1983.
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.
5. 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:6790, 1995.
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 (CC-CG'96), pages 155-160, 1996.
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.
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.
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.
10. J. G. Hocking and G. S. Young. Topology. Addison-Wesley, 1961.
11. J. M. Keil. Approximating the complete Euclidean graph. In 1st Scandinavian Workshop on Algorithm Theory (SWAT88), pages 208-213, 1988.
12. J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry, 7:13-28, 1992.
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.
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.
15. J. S. Salowe. Constructing multidimensional spanner graphs. International Journal of Computational Geometry & Applications, 1:99-107, 1991.
16. 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.
17. A. C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11:721-736, 1982.