The following pages link to (Q4411284):
Displaying 9 items.
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
- Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
- Facility location and the geometric minimum-diameter spanning tree. (Q1421033) (← links)
- Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree (Q1879253) (← links)
- Minimum diameter vertex-weighted Steiner tree (Q2039644) (← links)
- Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
- Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
- Facility Location in Dynamic Geometric Data Streams (Q3541125) (← links)
- (Q5009599) (← links)