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 6 items.
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- Bounded-hop communication networks (Q1755730) (← links)
- Minimizing the sum of distances to a server in a constraint network (Q2330034) (← links)
- On the Bounded-Hop Range Assignment Problem (Q3449812) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
