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.

The Steiner tree problem revisited through rectifiable G-currents / Marchese, A.; Massaccesi, A.. - In: ADVANCES IN CALCULUS OF VARIATIONS. - ISSN 1864-8258. - 2016, 9:1(2016), pp. 19-39. [10.1515/acv-2014-0022]

The Steiner tree problem revisited through rectifiable G-currents

Marchese A.;Massaccesi A.
2016-01-01

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.
2016
1
Marchese, A.; Massaccesi, A.
The Steiner tree problem revisited through rectifiable G-currents / Marchese, A.; Massaccesi, A.. - In: ADVANCES IN CALCULUS OF VARIATIONS. - ISSN 1864-8258. - 2016, 9:1(2016), pp. 19-39. [10.1515/acv-2014-0022]
File in questo prodotto:
File Dimensione Formato  
acv1.pdf

Open Access dal 01/02/2017

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 878.45 kB
Formato Adobe PDF
878.45 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/265913
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 23
  • ???jsp.display-item.citation.isi??? 22
social impact