The maximal-tour bound for minimal filling weight
Statement
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. The supplied text does not give a 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.