Toros Arikan

MazeNet: An Accurate, Fast, and Scalable Deep Learning Solution for Steiner Minimum Trees

2024 · arXiv (Cornell University)

The Obstacle Avoiding Rectilinear Steiner Minimum Tree (OARSMT) problem, which seeks the shortest interconnection of a given number of terminals in a rectilinear plane while avoiding obstacles, is a critical task in integrated circuit design, …