The following pages link to (Q4234097):
Displaying 36 items.
- Ordered theta graphs (Q598550) (← links)
- Routing on heavy-path WSPD-spanners (Q832910) (← links)
- Minimum power assignment in wireless ad hoc networks with spanner property (Q857765) (← links)
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Approximating geometric bottleneck shortest paths (Q1886239) (← links)
- On the power of the semi-separated pair decomposition (Q1947974) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Local routing in a tree metric \(1\)-spanner (Q2084633) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Approximating minimum Manhattan networks in higher dimensions (Q2258071) (← links)
- Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree (Q2258072) (← links)
- On Euclidean vehicle routing with allocation (Q2269139) (← links)
- Efficient construction of a bounded-degree spanner with low weight (Q2365175) (← links)
- The minimum Manhattan network problem: Approximations and exact solutions (Q2432734) (← links)
- Deformable spanners and applications (Q2507157) (← links)
- New Doubling Spanners: Better and Simpler (Q2954370) (← links)
- On the Power of the Semi-Separated Pair Decomposition (Q3183436) (← links)
- Geometric Spanner of Objects under L 1 Distance (Q3511351) (← links)
- The Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets (Q3612833) (← links)
- Testing Euclidean Spanners (Q4933382) (← links)
- Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322) (← links)
- Truly Optimal Euclidean Spanners (Q5071083) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Sparse communication networks and efficient routing in the plane (Q5138362) (← links)
- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs (Q5302070) (← links)
- Geometric Spanner of Segments (Q5387747) (← links)
- Light Spanners (Q5499739) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
- Small hop-diameter sparse spanners for doubling metrics (Q5901493) (← links)
- Generalized self-approaching curves (Q5929319) (← links)
- Local routing algorithms on Euclidean spanners with small diameter (Q6164009) (← links)
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points (Q6173263) (← links)
- Vertex fault-tolerant spanners for weighted points in polygonal domains (Q6174157) (← links)