A Multiple Steiner Trees Routing Algorithm

Abstract

In an X-Grid, a Multiple Steiner Trees Routing algorithm connects each group node via vertical, horizontal and oblique segments. So far the researches in this topic are few since the problem is NP-complete. The Multiple Steiner Trees Routing algorithm can be used to solve many well-known problems, such as the VDDGND routing problem in VLSI. This paper presents a novel Multiple Steiner Trees Routing algorithm, which adopts 4-geometry Steiner Trees Routing Heuristic algorithm to connect each group. The space and time complexities are O(pN) and O(p2N), respectively, where N is the number of nodes in the 2-D matrix and p is the number of terminal nodes, q is the number of groups.