ICCAD-2017 CAD contest in net open location finder with obstacles: Invited paper

In physical implementation, the quality of net open location finder would directly impact the quality of final routing result. It is important to consider both of the length of indicated paths and the turnaround time. To address this problem, the ICCAD-2017 contest encourages the research in obstacle-aware multi-layer shortest paths finding and the corresponding speedup techniques. We provided (i) a set of benchmarks and (ii) an evaluation metric that facilitate contestants to develop and test their new algorithms.

[1]  Yao-Wen Chang,et al.  Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  D. T. Lee,et al.  Efficient Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Geometric Reduction , 2014, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.