Proceedings of the international symposium on Optimal algorithms
Which triangulations approximate the complete graph?
Proceedings of the international symposium on Optimal algorithms
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On sparse spanners of weighted graphs
Discrete & Computational Geometry
A fast algorithm for constructing sparse Euclidean spanners
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A constant-factor approximation for the k-MST problem in the plane
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Euclidean spanners: short, thin, and lanky
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A new way to weigh Malnourished Euclidean graphs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Tree-Approximations for the Weighted Cost-Distance Problem
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Constructing Plane Spanners of Bounded Degree and Low Weight
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Fault-tolerant geometric spanners
Proceedings of the nineteenth annual symposium on Computational geometry
Finding the best shortcut in a geometric network
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Local approximation schemes for topology control
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Geometric Spanner of Objects under L1 Distance
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Computing Lightweight Spanners Locally
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On Spanners of Geometric Graphs
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Local Construction of Spanners in the 3-D Space
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On Spanners and Lightweight Spanners of Geometric Graphs
SIAM Journal on Computing
Distributed spanner construction in doubling metric spaces
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
I/O-Efficiently pruning dense spanners
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
The emergence of sparse spanners and greedy well-separated pair decomposition
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Minimum weight Euclidean t-spanner is NP-hard
Journal of Discrete Algorithms
On certain geometric properties of the Yao---Yao graphs
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Let V be a set of n points in 3-dimensional Euclidean space. A subgraph of the complete Euclidean graph is a t-spanner if for any u and v in V, the length of the shortest path from u to v in the spanner is at most ttimes d(u, v). We show that for any t 1, a greedy algorithm produces a t-spanner with O(n) edges, and total edge weight O(1).wt(MST), where MST is a minimum spanning tree of V.