For the past decade the Steiner minimal tree problem has attracted the attention of researchers in discrete optimization. A brief survey of the main results concerning the properties and algorithms of the Steiner problem in the Euclidean plane, the Steiner problem in the plane with rectilinear metric and the Steiner problem in networks is done in this paper. The main attention is paid to the recent results concerning the last problem.
Discrete Mathematics and Applications provides the latest information on the development of discrete mathematics in Russia to a world-wide readership. The journal covers various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.