Steiner minimal trees in rectilinear and octilinear planes

DOI10.1007/S10114-005-0910-0MaRDI QIDQ2463797zbMATH OpenOpenAlexFDO

Authors Song Pu Shang, Tong Jing

Publication date 6 December 2007

Published in Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10114-005-0910-0

zbMATH Keywords

minimum spanning treeSteiner minimal treeoctilinear planerectilinear plane

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Discrete approximations in optimal control (49M25)

Recommendations

• scientific article; zbMATH DE number 8006
• scientific article; zbMATH DE number 874212
• Steiner minimal trees for regular polygons
• Publication:4945793
• scientific article; zbMATH DE number 3922677
• Minimum Steiner trees in normed planes
• Exact computation of Steiner minimal trees in the plane
• scientific article; zbMATH DE number 1156670
• Publication:3484850
• The Steiner Minimal Tree problem in the λ-geometry plane

Cites work

• How Long Can a Euclidean Traveling Salesman Tour Be?
• On Some Distance Problems in Fixed Orientations
• On Steiner’s Problem with Rectilinear Distance
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• The Steiner tree problem

Cited in

(7)

• HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES
• Steiner minimal trees on regular polygons with centre
• Steiner minimal trees with one polygonal obstacle.
• Algorithms and Computation
• scientific article; zbMATH DE number 8006 (Why is no real title available?)
• Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles
• Algorithms and Computation

This page was built for publication: Steiner minimal trees in rectilinear and octilinear planes

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