Pages that link to "Item:Q963410"
From MaRDI portal
The following pages link to Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410):
Displaying 13 items.
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- Bounded-hop communication networks (Q1755730) (← links)
- Resilient \(k\)-d trees: \(k\)-means in space revisited (Q1762186) (← links)
- Time-space trade-offs for computing Euclidean minimum spanning trees (Q2294682) (← links)
- Minimizing the sum of distances to a server in a constraint network (Q2330034) (← links)
- On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
- Approximating \(k\)-hop minimum-spanning trees (Q2488210) (← links)
- On the Bounded-Hop Range Assignment Problem (Q3449812) (← links)
- Euclidean Distance Matrix Completion and Point Configurations from the Minimal Spanning Tree (Q4606658) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time (Q5700570) (← links)
- Structural Information and Communication Complexity (Q5710099) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
