Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces
Metric Geometry
2019-04-24 v1 Optimization and Control
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 and points are derived.
Keywords
Cite
@article{arxiv.1904.10216,
title = {Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces},
author = {A. O. Ivanov and A. A. Tuzhilin},
journal= {arXiv preprint arXiv:1904.10216},
year = {2019}
}
Comments
19 pages, 4 figures