Pages that link to "Item:Q1879253"
From MaRDI portal
The following pages link to Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree (Q1879253):
Displaying 8 items.
- Euclidean chains and their shortcuts (Q391221) (← links)
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
- Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410) (← links)
- Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
- Minimum diameter vertex-weighted Steiner tree (Q2039644) (← links)
- Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
- Reconfiguration of spanning trees with degree constraints or diameter constraints (Q6053473) (← links)