scientific article; zbMATH DE number 1424543

MaRDI QIDQ4945792zbMATH OpenFDO

Authors R. S. Booth, D. A. Thomas, Jiafeng Weng

Publication date 23 March 2000

zbMATH Keywords

shortest networkerSteiner trees

Mathematics Subject Classification ID

Trees (05C05) Steiner systems in finite geometry (51E10) Continuous location (90B85)

Review text

The classical planar Steiner problem connects a given set of points in the plane by a network with smallest overall edge length. In this paper the authors consider the problem where two points and a straight line have to be connected. It is shown that the problem can be tackled by solving some quartic equation. It should be noted that this problem which may sound purely academic may have some applications in the designs of mines and irrigation systems. For the entire collection see [Zbl 0932.00010].

Recommendations

• An analogue of Morse theory for planar linear networks and the generalized Steiner problem
• A variational approach to the Steiner network problem
• A.D. Alexandrov spaces with curvature bounded below
• scientific article; zbMATH DE number 764449
• On length-minimizing Steiner networks

Cited in

(3)

• Minimum networks for four points in space
• Exactly solvable and unsolvable shortest network problems in 3D-space
• scientific article; zbMATH DE number 1382484 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945792)