Pages that link to "Item:Q3149878"
From MaRDI portal
The following pages link to Fast Greedy Algorithms for Constructing Sparse Geometric Spanners (Q3149878):
Displayed 18 items.
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- On the stretch factor of Delaunay triangulations of points in convex position (Q621926) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- Stable roommates spanner (Q691764) (← links)
- Improved local algorithms for spanner construction (Q714769) (← links)
- Constructing minimum-interference networks (Q929744) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Computing the greedy spanner in near-quadratic time (Q1957650) (← links)
- A spanner for the day after (Q2223618) (← links)
- On certain geometric properties of the Yao-Yao graphs (Q2436661) (← links)
- Geometric Spanner of Objects under L 1 Distance (Q3511351) (← links)
- The Minimal Manhattan Network Problem in Three Dimensions (Q3605512) (← links)
- The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension (Q3644728) (← links)
- EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER (Q4818597) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- A GEOMETRIC SPANNER OF SEGMENTS (Q5305063) (← links)
- Geometric Spanner of Segments (Q5387747) (← links)
- A simple and efficient kinetic spanner (Q5902230) (← links)