Pages that link to "Item:Q3713880"
From MaRDI portal
The following pages link to An algorithm for the steiner problem in the euclidean plane (Q3713880):
Displaying 25 items.
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
- A primer of the Euclidean Steiner problem (Q1179729) (← 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)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- Improved computation of plane Steiner minimal trees (Q1186797) (← links)
- Two new criteria for finding Steiner hulls in Steiner tree problems (Q1186803) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs (Q1315998) (← links)
- A neural network for the Steiner minimal tree problem (Q1323577) (← links)
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study (Q1741111) (← links)
- A direct solution of allocation problems (Q1903256) (← links)
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (Q2064280) (← links)
- Computing Euclidean Steiner trees over segments (Q2219516) (← links)
- Geometry-experiment algorithm for Steiner minimal tree problem (Q2375521) (← links)
- Conversion of the Steiner problem on the Euclidean plane to the Steiner problem on graph (Q2457453) (← links)
- Steiner hull algorithm for the uniform orientation metrics (Q2479469) (← links)
- Local optimization in the Steiner problem on the Euclidean plane (Q2487670) (← links)
- An algorithm for finding 4-degree Steiner trees with a special topology (Q2706668) (← links)
- An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space (Q2827758) (← links)
- Euclidean Steiner minimum trees: An improved exact algorithm (Q4363408) (← links)
- Reorganizing topologies of Steiner trees to accelerate their eliminations (Q5216441) (← links)
- Numerical approximation of the Steiner problem in dimension $2$ and $3$ (Q5235091) (← links)
- Grade of service Steiner minimum trees in the Euclidean plane (Q5953596) (← links)
- An exact algorithm for the Euclidean \(k\)-Steiner tree problem (Q6577436) (← links)
