Simplifying obstacles for Steiner network problems in the plane

DOI10.1002/NET.22080MaRDI QIDQ6087564zbMATH OpenOpenAlexFDO

Authors Marcus Volz, M. Brazil, C. J. Ras, D. A. Thomas

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

backfillingMinkowski planeobstacle-avoiding networkspaddingreducingSteiner trees

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Steiner minimal trees with one polygonal obstacle.
• Steiner minimal trees for three points with one convex polygonal obstacle
• An Approximation Scheme for Finding Steiner Trees with Obstacles
• Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
• A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane

Cites work

• A flow-dependent quadratic Steiner tree problem in the Euclidean plane
• An Approximation Scheme for Finding Steiner Trees with Obstacles
• Approximations for a bottleneck Steiner tree problem
• Euclidean shortest paths. Exact or approximate algorithms.
• Exact algorithms for the bottleneck Steiner tree problem
• Generating random polygons with given vertices
• scientific article; zbMATH DE number 1424547 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Optimal interconnection trees in the plane. Theory, algorithms and applications
• Two-connected Steiner networks: structural properties

Cited in

(1)

• Removing Connected Obstacles in the Plane is FPT

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

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