Minimum Density Interconnection Trees

  title={Minimum Density Interconnection Trees},
  • Published 1992
21% increase in the tree cost over MST cost. Note that in the extended version of this work 1], we present a \computational lower bound" for a given problem instance. The method divides the unit square into an i by j (not necessarily uniform) rectangular grid such that the greatest number P of the resulting i j rectangles contain terminals. In order for the… CONTINUE READING