Simplifying obstacles for Steiner network problems in the plane

DOI10.1002/net.22080OpenAlexW3206199085MaRDI QIDQ6087564

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

Publication date: 12 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11343/299095

zbMATH Keywords

Minkowski planeSteiner treespaddingbackfillingreducingobstacle-avoiding networks

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Exact algorithms for the bottleneck Steiner tree problem
• Approximations for a bottleneck Steiner tree problem
• Generating random polygons with given vertices
• Optimal interconnection trees in the plane. Theory, algorithms and applications
• Two-connected Steiner networks: structural properties
• Euclidean Shortest Paths
• An Approximation Scheme for Finding Steiner Trees with Obstacles
• A flow‐dependent quadratic steiner tree problem in the Euclidean plane
• Unnamed Item
• Unnamed Item

This page was built for publication: Simplifying obstacles for Steiner network problems in the plane