New Results on Fault Tolerant Geometric Spanners
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 193-204
- https://doi.org/10.1007/3-540-48447-7_20
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Efficient algorithms for constructing fault-tolerant geometric spannersPublished by Association for Computing Machinery (ACM) ,1998
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fieldsJournal of the ACM, 1995
- Euclidean spannersPublished by Association for Computing Machinery (ACM) ,1995
- Classes of graphs which approximate the complete euclidean graphDiscrete & Computational Geometry, 1992
- A sparse graph almost as good as the complete graph on points inK dimensionsDiscrete & Computational Geometry, 1991
- CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHSInternational Journal of Computational Geometry & Applications, 1991
- Approximation algorithms for shortest path motion planningPublished by Association for Computing Machinery (ACM) ,1987
- There is a planar graph almost as good as the complete graphPublished by Association for Computing Machinery (ACM) ,1986
- Lower bounds for algebraic computation treesPublished by Association for Computing Machinery (ACM) ,1983
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982