Pages that link to "Item:Q3816989"
From MaRDI portal
The following pages link to An Approximation Scheme for Finding Steiner Trees with Obstacles (Q3816989):
Displaying 14 items.
- The Steiner problem on surfaces of revolution (Q742573) (← links)
- Shortest enclosing walks and cycles in embedded graphs (Q1116348) (← links)
- Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749) (← links)
- The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
- Steiner minimal trees for three points with one convex polygonal obstacle (Q1179763) (← links)
- Two new criteria for finding Steiner hulls in Steiner tree problems (Q1186803) (← links)
- Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs (Q1315998) (← links)
- Short trees in polygons (Q1348253) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- On the structure and complexity of the 2-connected Steiner network problem in the plane (Q1977645) (← links)
- An exact algorithm for constructing minimum Euclidean skeletons of polygons (Q2131144) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
- HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES (Q5297794) (← links)
- Simplifying obstacles for Steiner network problems in the plane (Q6087564) (← links)
