New pruning rules for the Steiner tree problem and 2-connected Steiner network problem

DOI10.1016/j.comgeo.2018.10.003zbMath1453.68201OpenAlexW2900846369WikidataQ111522277 ScholiaQ111522277MaRDI QIDQ1631775

Marcus Volz, Marcus Brazil, Martin Zachariasen, Charl J. Ras, Doreen Anne Thomas

Publication date: 7 December 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2018.10.003

zbMATH Keywords

Steiner trees2-connected networksGeoSteinerlunespruning rules

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane ⋮ Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane

Uses Software

• GeoSteiner

Cites Work

• Unnamed Item
• The Steiner tree problem
• The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
• On the structure and complexity of the 2-connected Steiner network problem in the plane
• Optimal interconnection trees in the plane. Theory, algorithms and applications
• Bounding component sizes of two-connected Steiner networks
• Two-connected Steiner networks: structural properties
• Euclidean Steiner minimum trees: An improved exact algorithm
• Steiner Minimal Trees

This page was built for publication: New pruning rules for the Steiner tree problem and 2-connected Steiner network problem