Euclidean Steiner minimum trees: An improved exact algorithm

DOI<149::AID-NET1>3.0.CO;2-L 10.1002/(SICI)1097-0037(199710)30:3<149::AID-NET1>3.0.CO;2-LzbMath0893.90170OpenAlexW2070308700MaRDI QIDQ4363408

Pawel Winter, Martin Zachariasen

Publication date: 6 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199710)30:3<149::aid-net1>3.0.co;2-l

zbMATH Keywords

Euclidean Steiner tree problemshortest networkrandomly generated problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (16)

Rotationally optimal spanning and Steiner trees in uniform orientation metrics ⋮ New pruning rules for the Steiner tree problem and 2-connected Steiner network problem ⋮ A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane ⋮ Unnamed Item ⋮ Computing Euclidean Steiner trees over segments ⋮ The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study ⋮ An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space ⋮ On the history of the Euclidean Steiner tree problem ⋮ The local Steiner problem in normed planes ⋮ Approximating minimum Steiner point trees in Minkowski planes ⋮ Local search for the Steiner tree problem in the Euclidean plane ⋮ An overview of exact algorithms for the Euclidean Steiner tree problem inn-space ⋮ Insight into the computation of Steiner minimal trees in Euclidean space of general dimension ⋮ Digital data networks design using genetic algorithms

This page was built for publication: Euclidean Steiner minimum trees: An improved exact algorithm