Given a set of pin-vertices, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects all the pin-vertices possibly through Steiner points using vertical and horizontal segments with ...

The minimum Steiner tree problem, a classical combinatorial optimization problem with a long history, is a NP-complete problem. Due to its wide application, study of heuristic algorithm about Steiner ...