Pages that link to "Item:Q1957650"
From MaRDI portal
The following pages link to Computing the greedy spanner in near-quadratic time (Q1957650):
Displaying 14 items.
- Distribution-sensitive construction of the greedy spanner (Q527422) (← links)
- Computing the greedy spanner in linear space (Q893321) (← links)
- A spanner for the day after (Q2223618) (← links)
- On path-greedy geometric spanners (Q2678257) (← links)
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals (Q2980919) (← links)
- Approximate Greedy Clustering and Distance Selection for Graph Metrics (Q3387276) (← links)
- The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension (Q3644728) (← links)
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t (Q4210144) (← links)
- (Q4449190) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- (Q5088946) (← links)
- Greedy spanners are optimal in doubling metrics (Q5236332) (← links)
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points (Q6173263) (← links)
- Vertex fault-tolerant spanners for weighted points in polygonal domains (Q6174157) (← links)