An exact rectilinear Steiner tree algorithm (1993) [13 citations — 6 self]
Abstract:
Given a set of terminals in the plane, a rectilinear Steiner minimal tree is a shortest interconnection among these terminals using only horizontal and vertical edges. We present an algorithm that constructs a rectilinear Steiner minimal tree for an input terminal set. On a workstation, problems involving 20 input terminals can be solved in a few seconds, and problems involving 30 input terminals can be solved, on average, in 30 minutes. Previous algorithms could only solve 16 or 17 point problems within the 30 minute time bound. 1
Citations
| 262 | The Steiner Tree Problem – Hwang, Richards, et al. - 1992 |
| 93 | A new class of iterative Steiner tree heuristics with good performance – Kahng, Robins - 1992 |
| 90 | On Steiner minimal trees with rectilinear distance – HWANG - 1976 |
| 28 | The Rectilinear Steiner Problem is NP-Complete – Garey, Johnson - 1977 |
| 13 | Rectilinear Steiner tree minimization on a workstation – Thomborson, Alpern, et al. - 1992 |
| 12 | An algorithm for the Steiner problem in the Euclidean plane – Winter - 1985 |
| 10 | Optimal and suboptimal solution algorithms for the wiring problem – Yang, Wing - 1972 |
| 5 | On minimal rectilinear Steiner trees – Sidorenko - 1989 |
| 2 | Hewgill, "Exact computation of Steiner minimal trees in the plane – Cockayne, E - 1986 |
| 2 | Hewgill, "Improved computation of plane Steiner minimal trees," Algorithmica 7 – Cockayne, E - 1992 |
| 2 | Cleave, "Optimum Steiner tree generation – Lewis, Pong, et al. - 1992 |

