An improved exact algorithm for the Euclidean k-Steiner tree problem

DOI10.1016/J.COMGEO.2026.102268MaRDI QIDQ7313488zbMATH OpenFDO

Authors Jae Lee, M. Brazil, C. J. Ras, D. A. Thomas

Publication date 13 August 2026

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COMGEO.2026.102268

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Programming involving graphs or networks (90C35)

Cites work

• An algorithm for the steiner problem in the euclidean plane
• An exact algorithm for the Euclidean k-Steiner tree problem
• Degree-five Steiner points cannot reduce network costs for planar sets
• Generalised \(k\)-Steiner tree problems in normed planes
• Generating subtour elimination constraints for the TSP from pure integer solutions
• Gradient-constrained discounted Steiner trees. II: Optimally locating a discounted Steiner point
• Network modelling of underground mine layout: two case studies
• On the history of the Euclidean Steiner tree problem
• On the restricted k-Steiner tree problem
• Optimal interconnection trees in the plane. Theory, algorithms and applications
• The 1-steiner tree problem

This page was built for publication: An improved exact algorithm for the Euclidean \(k\)-Steiner tree problem

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