Sublinear-time approximation of Euclidean minimum spanning tree
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete 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
t-Spanners for metric space searching
Data & Knowledge Engineering
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
Constructing minimum-interference networks
Computational Geometry: Theory and Applications
A simple and efficient kinetic spanner
Proceedings of the twenty-fourth annual symposium on Computational geometry
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
The Minimal Manhattan Network Problem in Three Dimensions
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
On Spanners of Geometric Graphs
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Experimental study of geometric t-spanners
Journal of Experimental Algorithmics (JEA)
Local Construction of Spanners in the 3-D Space
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Bootstrapping a hop-optimal network in the weak sensor model
ACM Transactions on Algorithms (TALG)
A simple and efficient kinetic spanner
Computational Geometry: Theory and Applications
Geodesic Spanners on Polyhedral Surfaces
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Experimental study of geometric t-spanners: a running time comparison
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Journal of Discrete Algorithms
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Balancing degree, diameter and weight in Euclidean spanners
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
On the stretch factor of Delaunay triangulations of points in convex position
Computational Geometry: Theory and Applications
Improved local algorithms for spanner construction
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
On Spanners and Lightweight Spanners of Geometric Graphs
SIAM Journal on Computing
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Improved upper bound on the stretch factor of delaunay triangulations
Proceedings of the twenty-seventh annual symposium on Computational geometry
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
Experimental study of geometric t-spanners
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A 1.5-approximation of the minimal manhattan network problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Fast pruning of geometric spanners
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Improved local algorithms for spanner construction
Theoretical Computer Science
Computational Geometry: Theory and Applications
Proceedings of the twenty-ninth annual symposium on Computational geometry
Optimal euclidean spanners: really short, thin and lanky
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On certain geometric properties of the Yao---Yao graphs
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Given a set V of n points in $\IR^d$ and a real constant t1, we present the first O(nlog n)-time algorithm to compute a geometric t-spanner on V. A geometric t-spanner on V is a connected graph G = (V,E) with edge weights equal to the Euclidean distances between the endpoints, and with the property that, for all $u,v\in V$, the distance between u and v in G is at most t times the Euclidean distance between u and v. The spanner output by the algorithm has O(n) edges and weight $O(1)\cdot wt(MST)$, and its degree is bounded by a constant.