Standard

BRANCHING POINTS IN THE PLANAR GILBERT-STEINER PROBLEM HAVE DEGREE 3. / Cherkashin, D.; Petrov, F.

в: Functional Analysis and its Applications, Том 10, № 2, 2025, стр. 331-338.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Cherkashin, D & Petrov, F 2025, 'BRANCHING POINTS IN THE PLANAR GILBERT-STEINER PROBLEM HAVE DEGREE 3', Functional Analysis and its Applications, Том. 10, № 2, стр. 331-338. <https://www.scopus.com/inward/record.uri?eid=2-s2.0-105007691979&partnerID=40&md5=7e62dfcf8995f6aecebfab83577a1773>

APA

Cherkashin, D., & Petrov, F. (2025). BRANCHING POINTS IN THE PLANAR GILBERT-STEINER PROBLEM HAVE DEGREE 3. Functional Analysis and its Applications, 10(2), 331-338. https://www.scopus.com/inward/record.uri?eid=2-s2.0-105007691979&partnerID=40&md5=7e62dfcf8995f6aecebfab83577a1773

Vancouver

Cherkashin D, Petrov F. BRANCHING POINTS IN THE PLANAR GILBERT-STEINER PROBLEM HAVE DEGREE 3. Functional Analysis and its Applications. 2025;10(2):331-338.

Author

Cherkashin, D. ; Petrov, F. / BRANCHING POINTS IN THE PLANAR GILBERT-STEINER PROBLEM HAVE DEGREE 3. в: Functional Analysis and its Applications. 2025 ; Том 10, № 2. стр. 331-338.

BibTeX

@article{2287b6176b9846d0a5134483e09ef33a,
title = "BRANCHING POINTS IN THE PLANAR GILBERT-STEINER PROBLEM HAVE DEGREE 3",
abstract = "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. {\textcopyright} Copyright 2025.",
keywords = "branched optimal transport, Gilbert-Steiner problem",
author = "D. Cherkashin and F. Petrov",
note = "Export Date: 05 February 2026; Cited By: 1",
year = "2025",
language = "English",
volume = "10",
pages = "331--338",
journal = "Functional Analysis and its Applications",
issn = "0016-2663",
publisher = "Springer Nature",
number = "2",

}

RIS

TY - JOUR

T1 - BRANCHING POINTS IN THE PLANAR GILBERT-STEINER PROBLEM HAVE DEGREE 3

AU - Cherkashin, D.

AU - Petrov, F.

N1 - Export Date: 05 February 2026; Cited By: 1

PY - 2025

Y1 - 2025

N2 - 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.

AB - 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.

KW - branched optimal transport

KW - Gilbert-Steiner problem

M3 - Article

VL - 10

SP - 331

EP - 338

JO - Functional Analysis and its Applications

JF - Functional Analysis and its Applications

SN - 0016-2663

IS - 2

ER -

ID: 149075211