Branching solutions to one-dimensional variational problems
This is a monograph which studies Steiner trees. The Steiner minimum tree is a shortest network interconnecting a finite set of points in a metric space. In this book, it is also considered as a branching solution of a one-dimensional variational problem. Starting with this consideration, the authors have done a sequence of research works which builds a bridge between discrete mathematics and differential geometry. Indeed, the Steiner tree has been put into manifolds in this book. Meanwhile, there are many open problems proposed by this book.NEWLINENEWLINENEWLINEThe book consists of six chapters. The first chapter contains preliminary results. The second chapter is about network extremality criteria. The third chapter is on linear networks in \(\mathbb{R}^n\). From chapter four to six, one-dimensional variational problems with different functionals are solved and as their branching solutions several Steiner trees in general forms are presented. Finally, sixty-two open problems are mentioned in the appendix. In summary, this is a nice contribution to the study of Steiner trees and a useful reference to the researchers in mathematics and computer science.
- Numerical calibration of Steiner trees
- Planar Manhattan local minimal and critical networks
- An evolutionary design of weighted minimum networks for four points in the three-dimensional Euclidean space
- Steiner type ratios of Gromov-Hausdorff space
- Fermat-Steiner problem in the metric space of compact sets endowed with Hausdorff distance
- A plasticity principle of convex quadrilaterals on a convex surface of bounded specific curvature
- Generalized Maxwell formula for the length of a minimal tree with a given topology
- Branched coverings and Steiner ratio
- The length of an extremal network in a normed space: Maxwell formula
- On geometric variation theory
- Branching geodesics in normed spaces
- Solving a generalized Gauss problem
- The plasticity of non-overlapping convex sets in \(\mathbb{R}^2\)
- Extremal networks in -geometry, where =3,4,6
- Realization of plane graphs as closed locally minimal nets on convex polyhedra
- The Fermat-Steiner problem in the space of compact subsets of endowed with the Hausdorff metric
- Boundary stability in the Fermat-Steiner problem in hyperspaces over finite-dimensional normed spaces
- The Fermat-Steiner problem in the space of compact subsets of the Euclidean plane
- On the static equilibria of branched elastic rods
- A Lagrangian program detecting the weighted Fermat-Steiner-Fréchet multitree for a Fréchet N-multisimplex in Euclidean N-space
- The existence problem for Steiner networks in strictly convex domains
This page was built for publication: Branching solutions to one-dimensional variational problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2718903)
