Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane

DOI10.1002/net.21835zbMath1407.90091OpenAlexW2857426276MaRDI QIDQ4628046

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

Publication date: 6 March 2019

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21835

zbMATH Keywords

computational geometrySteiner treesexact algorithmGeoSteiner2-connected Steiner networks2-edge-connected networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (1)

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

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum-weight two-connected spanning networks
• The convex-hull-and-line traveling salesman problem: A solvable case
• New pruning rules for the Steiner tree problem and 2-connected Steiner network problem
• 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
• The Steiner ratio Gilbert-Pollak conjecture is still open
• Two-connected Steiner networks: structural properties
• TSPLIB—A Traveling Salesman Problem Library
• On shortest two-connected Steiner networks with Euclidean distance
• Minimally 2-connected graphs.
• Steiner Minimal Trees

This page was built for publication: Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane