Ivanov–Tuzhilin half-perimeter formula for minimal fillings
Ivanov–Tuzhilin half-perimeter formula for minimal fillings
Let be a finite metric space. For a tree connecting , let be the set of tours of with respect to , and for each define the half-perimeter by
Let denote the weight of a minimal filling. Ivanov–Tuzhilin hypothesis. For an arbitrary metric space ,
where the minimum is taken over all binary trees connecting . The formula proposes a tour-based characterization of minimal filling weight; the source attributes it to A. Ivanov and A. Tuzhilin and gives no resolution.
Sources & referencesView supporting material
Primary source
A. O. Ivanov and A. A. Tuzhilin, “Optimal Networks”, arXiv:1210.6228 (2012).
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.