Steiner’s problem for set-terminals

DOI10.1090/qam/233286zbMath0267.52005OpenAlexW81711424MaRDI QIDQ5683874

Z. A. Melzak, E. J. Cockayne

Publication date: 1968

Published in: Quarterly of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/qam/233286

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (7)

GENERALIZED MELZAK'S CONSTRUCTION IN THE STEINER TREE PROBLEM ⋮ A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem ⋮ Solving group Steiner problems as Steiner problems. ⋮ Minimal length tree networks on the unit sphere ⋮ Steiner minimal trees for a class of zigzag lines ⋮ The prize-collecting generalized minimum spanning tree problem ⋮ Computation of Minimal Length Full Steiner Trees on the Vertices of a Convex Polygon

This page was built for publication: Steiner’s problem for set-terminals