The tour formula for minimal filling weight
Statement
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.
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.