On branching points in the Gilbert-Steiner problem

Abstract

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

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…