Steiner minimal trees in rectilinear and octilinear planes

DOI10.1007/s10114-005-0910-0zbMath1129.90048OpenAlexW2115416999MaRDI QIDQ2463797

Tong Jing, Song Pu Shang

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 treerectilinear planeoctilinear plane

Mathematics Subject Classification ID

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

Cites Work

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

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