The maximal-tour bound for minimal filling weight
Let be a pseudo-metric space joined by a tree . For a tour , let denote its corresponding perimeter, and let denote the weight of a minimal filling.
Maximal-tour conjecture. One has
This is presented as one of two conjectures implying a formula for the weight of a minimal filling of an arbitrary pseudo-metric space.
References
Status
- Solved: Alexander O. Ivanov and Alexey A. Tuzhilin. A formula for the weight of a minimal filling of a finite metric space (Sbornik: Mathematics, 2013) https://iopscience.iop.org/article/10.1070/SM2013v204n09ABEH004340/pdf
Source: A. O. Ivanov and A. A. Tuzhilin, “One-dimensional Gromov minimal filling”, arXiv:1101.0106 (2011).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.