Rectilinear steiner trees: Efficient special‐case algorithms
Authors:
Abstract
A minimal rectilinear Steiner tree for a set A of points in the plane is a tree which interconnects A using horizontal and vertical lines of shortest possible total length. Such trees have potential application to wire layout for printed circuits. Unfortunately, at present no practical algorithm is known for constructing these trees in general. We present two algorithms, each requiring a number of operations proportional to only a low degree polynomial in the number of points to be interconnected, for the special cases in which all the points of A lie on a small number of parallel lines or on the boundary of a rectangle.Keywords
This publication has 10 references indexed in Scilit:
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- On Steiner Minimal Trees with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1976
- The Generation of Minimal Trees with a Steiner TopologyJournal of the ACM, 1972
- Reducibility among Combinatorial Problems1972
- A Counterexample to a Theorem of Fu on Steiner's ProblemIEEE Transactions on Circuit Theory, 1972
- Steiner's problem in graphs and its implicationsNetworks, 1971
- The complexity of theorem-proving procedures1971
- The steiner problem in graphsNetworks, 1971
- Steiner Minimal TreesSIAM Journal on Applied Mathematics, 1968
- On Steiner’s Problem with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1966