Steiner minimal trees for three points with one convex polygonal obstacle

DOI10.1007/BF02067243zbMath0748.90073OpenAlexW2085143999MaRDI QIDQ1179763

Pawel Winter, James MacGregor Smith

Publication date: 27 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02067243

zbMATH Keywords

Steiner minimal treessingle polygonal obstaclethree points in the Euclidean plane

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (2)

Local search for the Steiner tree problem in the Euclidean plane ⋮ Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for the steiner problem in the euclidean plane
• Steiner problem in networks: A survey
• An Approximation Scheme for Finding Steiner Trees with Obstacles
• An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
• Steiner Minimal Trees
• Steiner tree problems

This page was built for publication: Steiner minimal trees for three points with one convex polygonal obstacle