Ivanov–Tuzhilin half-perimeter formula for minimal fillings
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.