A sparse graph almost as good as the complete graph on points in K dimensions
Discrete & Computational Geometry
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Classes of graphs which approximate the complete Euclidean graph
Discrete & Computational Geometry
Randomized algorithms
t-Spanners as a Data Structure for Metric Space Searching
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Spanners and message distribution in networks
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
The Geometric Dilation of Finite Point Sets
Algorithmica
Geometric Spanner Networks
Computing a minimum-dilation spanning tree is NP-hard
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Experimental study of geometric t-spanners
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Computing a minimum-dilation spanning tree is NP-hard
Computational Geometry: Theory and Applications
Light orthogonal networks with constant geometric dilation
Journal of Discrete Algorithms
Low-interference networks in metric spaces of bounded doubling dimension
Information Processing Letters
GD'12 Proceedings of the 20th international conference on Graph Drawing
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
Given a set S of n points in R^D, and an integer k such that 0=