Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces

Bibliographic Details
Title: Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces
Authors: Ivanov, A. O., Tuzhilin, A. A.
Publication Year: 2019
Collection: Mathematics
Subject Terms: Mathematics - Metric Geometry, Mathematics - Optimization and Control, 51F99, 90C35, 90C08, 49Q10, 90C27
Description: 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.
Comment: 19 pages, 4 figures
Document Type: Working Paper
DOI: 10.48550/arXiv.1904.10216
Access URL: http://arxiv.org/abs/1904.10216
Accession Number: edsarx.1904.10216
Database: arXiv
Description
DOI:10.48550/arXiv.1904.10216