Computation of Minimal Length Full Steiner Trees on the Vertices of a Convex Polygon

DOI10.2307/2004379zbMath0296.68048OpenAlexW4242890926MaRDI QIDQ4050137

E. J. Cockayne

Publication date: 1969

Full work available at URL: https://doi.org/10.2307/2004379

Mathematics Subject Classification ID

Trees (05C05) General topics in the theory of software (68N01) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites Work

• On the Problem of Steiner
• Steiner Minimal Trees
• On the Steiner Problem
• Steiner’s problem for set-terminals
• Unnamed Item