Randomized and deterministic algorithms for geometric spanners of small diameter
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 703-712
- https://doi.org/10.1109/sfcs.1994.365722
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- A fast algorithm for constructing sparse Euclidean spannersPublished by Association for Computing Machinery (ACM) ,1994
- On Euclidean spanner graphs with small degreePublished by Association for Computing Machinery (ACM) ,1992
- A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potential fields (preliminary version)Published by Association for Computing Machinery (ACM) ,1992
- 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
- Dynamic fractional cascadingAlgorithmica, 1990
- On Finding Lowest Common Ancestors: Simplification and ParallelizationSIAM Journal on Computing, 1988
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related ProblemsSIAM Journal on Computing, 1982
- A data structure for orthogonal range queriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978