Pages that link to "Item:Q4894866"
From MaRDI portal
The following pages link to An O(N<sup>2</sup>) heuristic for steiner minimal trees in E<sup>3</sup> (Q4894866):
Displaying 4 items.
- A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (Q763244) (← links)
- A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space (Q814961) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- Iterated local search algorithms for the Euclidean Steiner tree problem in<i>n</i>dimensions (Q2829166) (← links)
