The following pages link to Algorithms – ESA 2005 (Q5475865):
Displayed 7 items.
- \( \delta \)-greedy \(t\)-spanner (Q824327) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- Computing a minimum-dilation spanning tree is NP-hard (Q945943) (← links)
- Computing the greedy spanner in near-quadratic time (Q1957650) (← links)
- Computing the Greedy Spanner in Near-Quadratic Time (Q3512475) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- Light Euclidean Spanners with Steiner Points (Q5874539) (← links)