Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
From MaRDI portal
Recommendations
Cited in
(62)- Geometric spanners in the MapReduce model
- Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
- Computing the greedy spanner in near-quadratic time
- A spanner for the day after
- \(\delta\)-greedy \(t\)-spanner
- On certain geometric properties of the Yao-Yao graphs
- A lower bound for computing geometric spanners
- On path-greedy geometric spanners
- scientific article; zbMATH DE number 1617269 (Why is no real title available?)
- Distribution-sensitive construction of the greedy spanner
- The emergence of sparse spanners and well-separated pair decomposition under anarchy
- An optimal algorithm for computing angle-constrained spanners
- An optimal algorithm for computing angle-constrained spanners
- Visualization of geometric spanner algorithms
- Geometric Spanner of Objects under L 1 Distance
- The emergence of sparse spanners and greedy well-separated pair decomposition
- On plane geometric spanners: a survey and open problems
- The Minimal Manhattan Network Problem in Three Dimensions
- The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
- Geodesic spanners on polyhedral surfaces
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- A Fast Algorithm for Constructing Sparse Euclidean Spanners
- scientific article; zbMATH DE number 1775403 (Why is no real title available?)
- EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
- The greedy spanner is existentially optimal
- Local algorithms for bounded degree sparsifiers in sparse graphs
- Euclidean Steiner spanners: light and sparse
- Truly Optimal Euclidean Spanners
- A spanner for the day after
- A geometric spanner of segments
- Geometric Spanner of Segments
- Experimental study of geometric \(t\)-spanners
- Experimental Study of Geometric t-Spanners: A Running Time Comparison
- I/O-Efficiently Pruning Dense Spanners
- Algorithms – ESA 2005
- STACS 2005
- Constructing sparse t-spanners with small separators.
- A simple and efficient kinetic spanner
- Lower bounds for computing geometric spanners and approximate shortest paths
- Minimum weight Euclidean (1+)-spanners
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points
- Vertex fault-tolerant spanners for weighted points in polygonal domains
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners
- On the stretch factor of Delaunay triangulations of points in convex position
- On dynamic shortest paths problems
- A unified framework for light spanners
- A simple and efficient method for accelerating construction of the gap-greedy spanner
- A gap-ETH-tight approximation scheme for Euclidean TSP
- Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average degrees
- A unified framework of light spanners. I: Fast (yet optimal) constructions
- Stable roommates spanner
- Truly optimal Euclidean spanners
- Online Euclidean spanners
- Improved local algorithms for spanner construction
- On euclidean Steiner (1+)-spanners
- Light Euclidean Steiner spanners in the plane
- On the edge crossings of the greedy spanner
- Light spanners with small hop-diameter
- \( \delta \)-greedy \(t\)-spanner
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
- Constructing minimum-interference networks
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
This page was built for publication: Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3149878)
