Region-Fault Tolerant Geometric Spanners
Authors:
- 30 January 2009
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 41 (4) , 556-582
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Computational Geometry2008
- Dilation and Detours in Geometric Networks2007
- On separating systemsEuropean Journal of Combinatorics, 2007
- Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and OctreesJournal of Algorithms, 2001
- Spanning Trees and Spanners2000
- A Fast Algorithm for Constructing Sparse Euclidean SpannersInternational Journal of Computational Geometry & Applications, 1997
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fieldsJournal of the ACM, 1995
- Approximating the complete Euclidean graph1988
- Approximation algorithms for shortest path motion planning1987
- There is a planar graph almost as good as the complete graph1986