ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d≥1d\geq 1, and consider finite point configurations of d+1d+1 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 d+1d+1 vertices of a dd-dimensional regular simplex have the minimum Steiner ratio over all point configurations of d+1d+1 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.