Pages that link to "Item:Q4319526"
From MaRDI portal
The following pages link to Experimental evaluation of a partitioning algorithm for the steiner tree problem in <i>R</i><sup>2</sup> and <i>R</i><sup>3</sup> (Q4319526):
Displaying 4 items.
- A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (Q763244) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
- Iterated local search algorithms for the Euclidean Steiner tree problem in \(n\) dimensions (Q2829166) (← links)