Branching points in the planar Gilbert--Steiner problem have degree 3

2023/09/08 by Danila Cherkashin, Cherkashin, Danila, Fedor Petrov +1 · 1 citation
Computer Science · Engineering · #Advanced Graph Theory Research #Advanced Optical Network Technologies #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG) #VLSI and FPGA Design Techniques

paper · pdf · doi:10.48550/arxiv.2309.04202

openalex publication_date 2023/09/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Gilbert--Steiner problem is a generalization of the Steiner tree problem on a specific optimal mass transportation. We show that every branching point in a solution of the planar Gilbert--Steiner problem has degree 3.

Cited by

• On branching points in the Gilbert-Steiner problem

Related

• On branching points in the Gilbert-Steiner problem
• An optimal irrigation network with infinitely many branching points
• Energy minimizing maps with prescribed singularities and Gilbert-Steiner optimal networks
• Prize-Collecting Steiner Tree and Forest in Planar Graphs
• Optimal algorithm for computing Steiner 3-eccentricities of trees