ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let NN be a set of terminals embedded in the Euclidean plane, and let GG be any tree topology on NN whose Steiner points have degree at least three. Fixed-topology bead-minimization conjecture. Finding a tree TT on NN with the same topology as GG and minimizing beads(T)\mathrm{beads}(T) can be done in polynomial time. This conjecture is motivated by the prospect of a polynomial-time algorithm based on displacing Steiner points of a Steiner minimum tree; the supplied text 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 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.