A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
From MaRDI portal
Publication:763244
DOI10.1007/s10732-010-9137-zzbMath1233.68237MaRDI QIDQ763244
Jeffrey W. Ohlmann, Jon W. Van Laarhoven
Publication date: 9 March 2012
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-010-9137-z
68W40: Analysis of algorithms
05C35: Extremal problems in graph theory
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
- A proof of the Gilbert-Pollak conjecture on the Steiner ratio
- How to find Steiner minimal trees in Euclidean \(d\)-space
- Two heuristics for the Euclidean Steiner tree problem
- Local search for the Steiner tree problem in the Euclidean plane
- Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
- Steiner Trees for Ladders
- The Complexity of Computing Steiner Minimal Trees
- A delaunay triangulation‐based heuristic for the euclidean steiner problem
- Experimental evaluation of a partitioning algorithm for the steiner tree problem in R2 and R3
- An O(N2) heuristic for steiner minimal trees in E3
- Steiner Minimal Trees
