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

Abstract

Abstract 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.