EUVIMEDSkopri EUVIMED
Open access · CC BY 4.0

On Branching Points in the Gilbert-Steiner Problem

Danila Cherkashin

Journal of Convex Analysis · 2027 · 34 (1) · 262-270

DOI: 10.68381/jca34019 ↗

At a glance

Journal article in Journal of Convex Analysis, 2027. Written by Danila Cherkashin. 18 references. The full text is freely available (open access, CC BY 4.0).

AstrattDettalji biblijografiċiCiteRelated studies

Abstract (original language)

The Gilbert-Steiner problem is a generalization of the Steiner tree problem and specific optimal mass transportation, which allows the use of additional (branching) points in a transport plan. A specific feature of the problem is that the cost of transporting a mass m m along a segment of length l l is equal to l \cdot m^p l ⋅ m p for a fixed 0 < p < 1 0 < p < 1 and segments may end at points not belonging to the supports of given measures (branching points). The main result of this paper determines all pairs of (p,d) ( p , d ) for which the Gilbert-Steiner problem in \mathbb{R}^d R d admits only branching points of degree 3. Namely, it happens if and only if d = 2 d = 2 or p < 1/2 p < 1 / 2 .

Cite

APA

Cherkashin, D. (2027). On Branching Points in the Gilbert-Steiner Problem. Journal of Convex Analysis, 34(1), 262-270. https://doi.org/10.68381/jca34019

Vancouver

Cherkashin D. On Branching Points in the Gilbert-Steiner Problem. Journal of Convex Analysis. 2027;34(1):262-270. doi:10.68381/jca34019

BibTeX
@article{Cherkashin2027,
  author = {Cherkashin, Danila},
  title = {On Branching Points in the Gilbert-Steiner Problem},
  journal = {Journal of Convex Analysis},
  year = {2027},
  volume = {34},
  number = {1},
  pages = {262--270},
  doi = {10.68381/jca34019}
}
Start for free →