The tour formula for minimal filling weight
The tour formula for minimal filling weight
For a pseudo-metric space , let be the weight of a minimal filling. For a tree with boundary , let be its tours and let be the perimeter associated with a tour .
Minimal-filling tour formula. For an arbitrary pseudo-metric space ,
where the minimum may be taken over all trees with boundary , or equivalently over all binary trees with boundary .
The paper says this formula follows from the two preceding conjectures, so it is a conjectural consequence rather than an independently established theorem in the supplied passage. It would give a formula for calculating the weight of a minimal filling for every pseudo-metric space.
Sources & referencesView supporting material
Primary source
A. O. Ivanov and A. A. Tuzhilin, “One-dimensional Gromov minimal filling”, arXiv:1101.0106 (2011).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.