Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane

DOI10.1007/s10957-023-02203-6zbMath1527.90244OpenAlexW4365151430MaRDI QIDQ6167087

Charl J. Ras, Alexander Westcott, Marcus Brazil

Publication date: 7 July 2023

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-023-02203-6

zbMATH Keywords

Steiner treesexact algorithmgeometric networksAlfaro's conjecturedirected Steiner networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Signed and weighted graphs (05C22)

Cites Work

• Improved approximation algorithms for directed Steiner forest
• On the complexity of the Steiner problem
• 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
• Existence of shortest directed networks in \(\mathbb{R}^ 2\)
• Shortest directed networks in the plane
• On the history of the Euclidean Steiner tree problem
• Optimal interconnection trees in the plane. Theory, algorithms and applications
• Two-connected Steiner networks: structural properties
• The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
• Euclidean Steiner minimum trees: An improved exact algorithm
• On the existence of shortest directed networks
• Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane
• Steiner Minimal Trees
• Steiner tree problems

This page was built for publication: Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane