Search
Front page
Data sets
Persons
Projects
Organizational units
Research output
Activities
Press/Media
About
BRANCHING POINTS IN THE PLANAR GILBERT-STEINER PROBLEM HAVE DEGREE 3
Research output
:
Contribution to journal
›
Article
›
peer-review
Chebyshev Laboratory of Interdisciplinary Reasearch
Образовательный центр искусственного интеллекта и информационных технологий
Faculty of Mathemathics and Computer Sciences
Overview
Cite this
Links
https://www.scopus.com/inward/record.uri?eid=2-s2.0-105007691979&partnerID=40&md5=7e62dfcf8995f6aecebfab83577a1773
D. Cherkashin
F. Petrov
The 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 to the planar Gilbert-Steiner problem has degree 3. © Copyright 2025.
Original language
English
Pages (from-to)
331-338
Number of pages
8
Journal
Functional Analysis and its Applications
Volume
10
Issue number
2
State
Published -
2025
Research areas
branched optimal transport, Gilbert-Steiner problem
ID: 149075211