Pages that link to "Item:Q3512475"
From MaRDI portal
The following pages link to Computing the Greedy Spanner in Near-Quadratic Time (Q3512475):
Displaying 7 items.
- Minimum weight Euclidean \(t\)-spanner is NP-hard (Q396666) (← links)
- Distribution-sensitive construction of the greedy spanner (Q527422) (← links)
- \( \delta \)-greedy \(t\)-spanner (Q824327) (← links)
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals (Q2980919) (← links)
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t (Q4210144) (← links)
- (Q4449190) (← links)
- Greedy spanners are optimal in doubling metrics (Q5236332) (← links)