Pages that link to "Item:Q4354006"
From MaRDI portal
The following pages link to A Fast Algorithm for Constructing Sparse Euclidean Spanners (Q4354006):
Displayed 18 items.
- Minimum weight Euclidean \(t\)-spanner is NP-hard (Q396666) (← links)
- \( \delta \)-greedy \(t\)-spanner (Q824327) (← links)
- Constructing minimum-interference networks (Q929744) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Region-fault tolerant geometric spanners (Q1016540) (← links)
- Computing the greedy spanner in near-quadratic time (Q1957650) (← links)
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- Distributed construction of low-interference spanners (Q2377128) (← links)
- Computing the Greedy Spanner in Near-Quadratic Time (Q3512475) (← links)
- The Minimal Manhattan Network Problem in Three Dimensions (Q3605512) (← links)
- EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER (Q4818597) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322) (← links)
- Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
- Shortest-Path Queries in Geometric Networks (Q6065461) (← links)
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points (Q6173263) (← links)
- Vertex fault-tolerant spanners for weighted points in polygonal domains (Q6174157) (← links)
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners (Q6201907) (← links)