The Steiner tree problem revisited through rectifiable G-currents

DOI10.1515/ACV-2014-0022zbMATH Open1334.49143arXiv1408.2696OpenAlexW2029614389MaRDI QIDQ905394FDOQ905394

Authors: Andrea Marchese, Annalisa Massaccesi 

Publication date: 19 January 2016

Published in: Advances in the Calculus of Variations (Search for Journal in Brave)

Abstract: The Steiner tree problem can be stated in terms of finding a connected set of minimal length containing a given set of finitely many points. We show how to formulate it as a mass-minimization problem for $1$-dimensional currents with coefficients in a suitable normed group. The representation used for these currents allows to state a calibration principle for this problem. We also exhibit calibrations in some examples.

Full work available at URL: https://arxiv.org/abs/1408.2696

Recommendations

• Numerical calibration of Steiner trees
• scientific article; zbMATH DE number 1339503
• Calibrations for minimal networks in a covering space setting
• On length-minimizing Steiner networks
• On different notions of calibrations for minimal partitions and minimal networks in \(\mathbb{R}^2\)

zbMATH Keywords

calibrationSteiner tree problemrectifiable currentsflat \(G\)-chainsmass-minimization problem

Mathematics Subject Classification ID

Variational problems in a geometric measure-theoretic setting (49Q20) Geometric measure and integration theory, integral and normal currents in optimization (49Q15)

Cited In (21)

• Calibrations for minimal networks in a covering space setting
• Convex relaxation and variational approximation of the Steiner problem: theory and numerics
• A multi-material transport problem with arbitrary marginals
• Convex relaxation and variational approximation of functionals defined on 1-dimensional connected sets
• Coefficient groups inducing nonbranched optimal transport
• Variational approximation of functionals defined on \(1\)-dimensional connected sets in \(\mathbb{R}^n\)
• A multimaterial transport problem and its convex relaxation via rectifiable \(G\)-currents
• Existence and uniqueness of the motion by curvature of regular networks
• Minimizing properties of networks via global and local calibrations
• Stability for the mailing problem
• Improved stability of optimal traffic paths
• On different notions of calibrations for minimal partitions and minimal networks in \(\mathbb{R}^2\)
• Elastic networks, statics and dynamics
• An optimal irrigation network with infinitely many branching points
• Energy minimizing maps with prescribed singularities and Gilbert-Steiner optimal networks
• A convex approach to the Gilbert-Steiner problem
• Metastability and dynamics of discrete topological singularities in two dimensions: a \(\Gamma\)-convergence approach
• Modeling of dislocations and relaxation of functionals on 1-currents with discrete multiplicity
• Numerical calibration of Steiner trees
• Variational approximation of functionals defined on 1-dimensional connected sets: the planar case
• The oriented mailing problem and its convex relaxation

This page was built for publication: The Steiner tree problem revisited through rectifiable \(G\)-currents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905394)