Convex relaxation and variational approximation of the Steiner problem: theory and numerics

Convex relaxation and variational approximation of the Steiner problem: theory and numerics

We survey some recent results on convex relaxations and a variational approximation for the classical Euclidean Steiner tree problem and we see how these new perspectives can lead to effective numerical schemes for the identification of Steiner minimal trees.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Geometric flows 2018-03, Vol.3 (1), p.19-27
1. Verfasser: Bonafini, M.
Format: Artikel
Sprache:eng
Schlagworte:
49J45
49M20
49Q15
49Q20
65K10
Calculus of Variations
Convex relaxation
Gamma-convergence
Geometric Measure Theory
Steiner problem
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We survey some recent results on convex relaxations and a variational approximation for the classical Euclidean Steiner tree problem and we see how these new perspectives can lead to effective numerical schemes for the identification of Steiner minimal trees.
ISSN:2353-3382
2353-3382
DOI:10.1515/geofl-2018-0003