Abstract:
It is proved that any locally minimal tree on Euclidean space can be “stabilized” (i.e., rendered shortest) by adding boundary vertices without changing the initial tree as a set in space. This result is useful for constructing examples of shortest trees.
Keywords:
Steiner's problem, Steiner minimal tree, shortest tree, shortest network, framed network, Euclidean network, stabilization of a network.
Citation:
A. O. Ivanov, A. A. Tuzhilin, “Stabilization of Locally Minimal Trees”, Mat. Zametki, 86:4 (2009), 512–524; Math. Notes, 86:4 (2009), 483–492
This publication is cited in the following 4 articles:
I. L. Laut, “Correlation between the norm and the geometry of minimal networks”, Sb. Math., 208:5 (2017), 684–706
Ivanov A.O. Tuzhilin A.A., “Minimal Networks: a Review”, Advances in Dynamical Systems and Control, Studies in Systems Decision and Control, 69, ed. Sadovnichiy V. Zgurovsky M., Springer Int Publishing Ag, 2016, 43–80
A. O. Ivanov, A. E. Mel'nikova, A. A. Tuzhilin, “Stabilization of a locally minimal forest”, Sb. Math., 205:3 (2014), 387–418
A. O. Ivanov, O. A. S'edina, A. A. Tuzhilin, “The Structure of Minimal Steiner Trees in the Neighborhoods of the Lunes of Their Edges”, Math. Notes, 91:3 (2012), 339–353