Use of Steiner´s problem in suboptimal routing in rectilinear metric

Using known results in Steiner´s problem, suboptimal algorithms are advanced for routing single nets subject to the minimum length constraint and multinets subject to the minimum length and maximum allowable channel capacity constraints. Implementation of the algorithm on a large number of randomly generated examples indicates feasibility of fast CPU execution time and good quality of solution in comparison with other existing algorithms.