The following pages link to (Q3922181):
Displayed 8 items.
- Two probabilistic results on rectilinear Steiner trees (Q1105495) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Steiner's problem in graphs: Heuristic methods (Q1201819) (← links)
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (Q1309809) (← links)
- The Steiner tree problem in orientation metrics (Q1384537) (← links)
- Minimum rectilinear Steiner tree of \(n\) points in the unit square (Q1699296) (← links)
- A probably fast, provably optimal algorithm for rectilinear Steiner trees (Q4312746) (← links)