Simplex-is-the-best conjecture for fixed terminal count
Statement
Let , and consider finite point configurations of points in Euclidean space. Their Steiner ratio is the ratio of the cost of the optimal Steiner tree to the cost of the minimum spanning tree. Simplex-is-the-best conjecture. The vertices of a -dimensional regular simplex have the minimum Steiner ratio over all point configurations of points in Euclidean space. This is a fixed-terminal analogue of the higher-dimensional Gilbert–Pollak conjecture: the number of terminals is bounded, rather than the ambient dimension. The source presents it as relevant to the computational study of Euclidean Steiner trees; its resolution is not given.
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.