Sbornik Mathematics · 2012 · 46 citations · 15 references
Natural SciencesMathematicsDiscrete MathematicsGeometryTopologyCombinatorial OptimizationGraph TheoryLow-dimensional TopologyShortest Path ProblemsShortest PathsSteiner Tree ProblemVariational Problems
The paper is devoted to a new branch in the theory of one-dimensional variational problems with branching extremals, the investigation of one-dimensional minimal fillings introduced by the authors. On the one hand, this problem is a one-dimensional version of a generalization of Gromov's minimal fillings problem to the case of stratified manifolds. On the other hand, this problem is interesting in itself and also can be considered as a generalization of another classical problem, the Steiner problem on the construction of a shortest network connecting a given set of terminals. Besides the statement of the problem, we discuss several properties of the minimal fillings and state several conjectures. Bibliography: 38 titles.
15
Mikhael Gromov · Journal of Differential Geometry · 1983 · 942 citations · Full text
E. N. Gilbert, H. O. Pollak · SIAM Journal on Applied Mathematics · 1968 · 938 citations
A proof of the Gilbert-Pollak conjecture on the Steiner ratio
D. Z. Du, F. K. Hwang · Algorithmica · 1992 · 180 citations
Distance matrix of a graph and its realizability
S. L. Hakimi, S. S. Yau · Quarterly of Applied Mathematics · 1965 · 170 citations · Full text