Pages that link to "Item:Q687085"
From MaRDI portal
The following pages link to On better heuristics for Steiner minimum trees (Q687085):
Displaying 14 items.
- A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space (Q814961) (← links)
- A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem (Q920030) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- Improved computation of plane Steiner minimal trees (Q1186797) (← links)
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (Q1309809) (← links)
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points (Q1607061) (← links)
- Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- On greedy heuristic for Steiner minimum trees (Q1891232) (← links)
- On shortest \(k\)-edge-connected Steiner networks in metric spaces (Q1977864) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points (Q3453286) (← links)
- On shortest two-connected Steiner networks with Euclidean distance (Q4540072) (← links)
- Grade of service Steiner minimum trees in the Euclidean plane (Q5953596) (← links)
