The following pages link to (Q4828971):
Displayed 6 items.
- 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)
- Computing Klee's measure of grounded boxes (Q2346960) (← links)
- Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)