Euclidean Steiner minimum trees: An improved exact algorithm

DOI10.1002/(SICI)1097-0037(199710)30:3%3C149::AID-NET1%3E3.0.CO;2-LMaRDI QIDQ4363408zbMATH OpenOpenAlexFDO

Authors 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%3C149::aid-net1%3E3.0.co;2-l

zbMATH Keywords

Euclidean Steiner tree problemrandomly generated problemshortest network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1424547
• An algorithm for the steiner problem in the euclidean plane
• scientific article; zbMATH DE number 1305548
• scientific article; zbMATH DE number 1163724

Cited in

(32)

• Improved computation of plane Steiner minimal trees
• Digital data networks design using genetic algorithms
• New pruning rules for the Steiner tree problem and 2-connected Steiner network problem
• The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
• Local search for the Steiner tree problem in the Euclidean plane
• Rotationally optimal spanning and Steiner trees in uniform orientation metrics
• Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
• Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
• Computing Euclidean Steiner trees over segments
• On the history of the Euclidean Steiner tree problem
• Euclidean Steiner trees optimal with respect to swapping 4-point subtrees
• An overview of exact algorithms for the Euclidean Steiner tree problem in n-space
• Approximating minimum Steiner point trees in Minkowski planes
• A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space
• An Improved Algorithm for Steiner Trees
• Augmenting Euclidean Networks—the Steiner Case
• An algorithm for the steiner problem in the euclidean plane
• scientific article; zbMATH DE number 1305548 (Why is no real title available?)
• scientific article; zbMATH DE number 1947438 (Why is no real title available?)
• The local Steiner problem in normed planes
• Computing minimum 2-edge-connected Steiner networks in the Euclidean plane
• scientific article; zbMATH DE number 1424547 (Why is no real title available?)
• scientific article; zbMATH DE number 1424549 (Why is no real title available?)
• Reorganizing topologies of Steiner trees to accelerate their eliminations
• Solving Steiner trees: Recent advances, challenges, and perspectives
• Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane
• An initial study of budgeted Steiner networks
• An exact algorithm for the Euclidean k-Steiner tree problem
• On better heuristics for Steiner minimum trees
• Mathematical optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\)
• Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points
• An improved algorithm for computing Steiner minimal trees in Euclidean d-space

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

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