Pages that link to "Item:Q1315998"
From MaRDI portal
The following pages link to Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs (Q1315998):
Displaying 9 items.
- Maximising the worth of nascent networks (Q301061) (← links)
- Steiner minimal trees for three points with one convex polygonal obstacle (Q1179763) (← links)
- Short trees in polygons (Q1348253) (← links)
- On the restricted 1-Steiner tree problem (Q2019490) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- A Prim-based heuristic algorithm for obstacle avoiding rectilinear Steiner minimal tree (Q2816044) (← links)
- Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles (Q4981173) (← links)
- Steiner minimal trees with one polygonal obstacle. (Q5943667) (← links)
- Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\) (Q5961625) (← links)