Learn More
For the <i>obstacle-avoiding rectilinear Steiner minimal tree</i> (OARSMT) problem, this paper presents a Steiner-point based algorithm to achieve the best practical performance in wirelength and run time. Unlike many previous works, the Steiner-based framework is more focused on the usage of Steiner points instead of the handling of obstacles. This paper(More)
  • 1