|
ИСТИНА |
Войти в систему Регистрация |
ФНКЦ РР |
||
Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaceстатья Электронная публикация
- Авторы: Alexander Ivanov, Alexey Tuzhilin
- Журнал: ArXiv e-prints: arXiv:1907.03828
- Год издания: 2019
- Аннотация: The present paper is devoted to studying of minimal parametric fillings of finite metric spaces (a version of optimal connection problem) by methods of Linear Programming. The estimate on the multiplicity of multi-tours appearing in the formula of weight of minimal fillings is improved, an alternative proof of this formula is obtained, and also explicit formulas for finite spaces consisting of 5 and 6 points are derived.
- Добавил в систему: Иванов Александр Олегович