Minimal length tree networks on the unit sphere
From MaRDI portal
Publication:1179757
DOI10.1007/BF02067239zbMath0741.90081MaRDI QIDQ1179757
Publication date: 27 June 1992
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items
An analytical solution of the weighted Fermat-Torricelli problem on a unit sphere ⋮ Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\) ⋮ Spatial Homogeneity Pursuit of Regression Coefficients for Large Datasets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Problem of Steiner
- Steiner Minimal Trees on Zig-Zag Lines
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Steiner problem in networks: A survey
- Minimum Spanning Trees in k-Dimensional Space
- Location Dominance on Spherical Surfaces
- Facility Location on a Sphere
- Steiner's problem and fagnano's result on the sphere
- An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
- Finding Minimum Spanning Trees
- A Lower Bound for the Steiner Tree Problem
- Steiner Trees for Ladders
- The Complexity of Computing Steiner Minimal Trees
- Steiner Minimal Trees
- Euclidean Constructibility in Graph-Minimization Problems
- The Generation of Minimal Trees with a Steiner Topology
- On Fermat's Problem on the Surface of a Sphere
- Steiner’s problem for set-terminals
