Rectilinear group Steiner trees and applications in VLSI design


Given a set of disjoint groups of points in the plane, the rectilinear group Steiner tree problem is the problem of nding a shortest intercon-nection (under the rectilinear metric) which includes at least one point from each group. This is an important generalization of the well-known rectilinear Steiner tree problem which has direct applications in VLSI… (More)
DOI: 10.1007/s10107-002-0326-x


3 Figures and Tables

Slides referencing similar topics