 Steiner trees with infinitely many terminals on the sides of an angleDanila Cherkashin (),
Emanuele Paolini and
Yana Teplitskaya
Journal of Combinatorial Optimization, 2025, vol. 49, issue 3, No 5, 28 pages Abstract: Abstract The Euclidean Steiner problem is the problem of finding a set $$\mathcal{S}\mathcal{t}$$ S t , with the shortest length, such that $$\mathcal{S}\mathcal{t}\cup \mathcal {A}$$ S t ∪ A is connected, where $$\mathcal {A}$$ A is a given set in a Euclidean space. The solutions $$\mathcal{S}\mathcal{t}$$ S t to the Steiner problem will be called Steiner sets while the set $$\mathcal {A}$$ A will be called input. Since every Steiner set is acyclic we call it Steiner tree in the case when it is connected. We say that a Steiner tree is indecomposable if it does not contain any Steiner tree for a subset of the input. We are interested in finding the Steiner set when the input consists of infinitely many points distributed on two lines. In particular we would like to find a configuration which gives an indecomposable Steiner tree. It is natural to consider a self-similar input, namely the set $$\mathcal {A}_{\alpha ,\lambda }$$ A α , λ of points with coordinates $$(\lambda ^{k-1}\cos \alpha ,$$ ( λ k - 1 cos α , $$\pm \lambda ^{k-1}\sin \alpha )$$ ± λ k - 1 sin α ) , where $$\lambda >0$$ λ > 0 and $$\alpha >0$$ α > 0 are small fixed values and $$k \in \mathbb {N}$$ k ∈ N . These points are distributed on the two sides of an angle of size $$2\alpha $$ 2 α in such a way that the distances from the points to the vertex of the angle are in a geometric progression. To our surprise, we show that in this case the solutions to the Steiner problem for $$\mathcal {A}_{\alpha ,\lambda }$$ A α , λ , when $$\alpha $$ α and $$\lambda $$ λ are small enough, are always decomposable trees. More precisely, any Steiner tree for $$\mathcal {A}_{\alpha ,\lambda }$$ A α , λ is a countable union of Steiner trees, each one connecting 5 points from the input. Each component of the decomposition can be mirrored with respect to the angle bisector providing $$2^{\mathbb N}$$ 2 N different solutions with the same length. By considering only a finite number of components we obtain many solutions to the Steiner problem for finite sets composed of $$4k+1$$ 4 k + 1 points distributed on the two lines ( $$2k+1$$ 2 k + 1 on a line and 2k on the other line). These solutions are very similar to the ladders of Chung and Graham. We are able to obtain an indecomposable Steiner tree by adding, to the previous input, a single point strategically placed inside the angle. In this case the solution is in fact a self-similar tree (in the sense that it contains a homothetic copy of itself). Finally, we show how the position of the Steiner points in the Steiner tree can be described by a discrete dynamical system which turns out to be equivalent to a 2-interval piecewise linear contraction. Keywords: Steiner tree; Explicit solution; Piecewise linear contraction (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:3:d:10.1007_s10878-025-01277-4 Ordering information: This journal article can be ordered from DOI: 10.1007/s10878-025-01277-4 Access Statistics for this article Journal of Combinatorial Optimization is currently edited by Thai, My T. More articles in Journal of Combinatorial Optimization from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.