arXiv · 1904.10216
Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces
Abstract
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.
Explore related subjects
Keep this discovery
A. O. Ivanov, A. A. Tuzhilin. 2019-04-23. Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces. https://arxiv.org/abs/1904.10216
Cite the original work for its findings. Save a collection to share your selection of sources.