[1] C. J. Alpert. The ispd98 circuit benchmark suite. In Proceedings of the 1998 international symposium on Physical design, pages 80-85, 1998.
[2] A. Borji. Pros and cons of gan evaluation measures: New developments. Computer Vision and Image Understanding, 215:103329, 2022.
[3] G. Chen, C. W. Pui, H. Li, J. Chen, B. Jiang, and E. F. Young. Detailed routing by sparse grid graph and minimum-area-captured path search. In Proceedings of the 24th Asia and South Pacific Design Automation Conference, 2019.
[4] H.-Y. Chen and Y.-W. Chang. Global and detailed routing. In Electronic Design Automation, pages 687-749. Elsevier, 2009.
[5] C.-Y. Cheng, F. Huang, G. Li, and Y. Li. Play: Parametrically conditioned layout generation using latent diffusion. arXiv preprint arXiv:2301.11529, 2023.
[6] R. Cheng, X. Lyu, Y. Li, J. Ye, J. Hao, and J. Yan. The policy-gradient placement and generative routing neural networks for chip design. In Advances in Neural Information Processing Systems, 2022.
[7] R. Cheng and J. Yan. On joint learning for solving placement and routing in chip design. In Advances in Neural Information Processing Systems, 2021.
[8] M. Cho, K. Lu, K. Yuan, and D. Z. Pan. Boxrouter 2.0: Architecture and implementation of a hybrid and robust global router. In 2007 IEEE/ACM International Conference on Computer-Aided Design, pages 503-508. IEEE, 2007.
[9] J. de Vincente, J. Lanchares, and R. Hermida. Rsr: A new rectilinear steiner minimum tree approximation for fpga placement and global routing. In Proceedings. 24th EUROMICRO Conference (Cat. No. 98EX204), volume 1, pages 192-195. IEEE, 1998.
[10] M. R. Garey and D. S. Johnson. The rectilinear steiner tree problem is np-complete. SIAM Journal on Applied Mathematics, 32(4):826-834, 1977.
[11] I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio. Generative adversarial nets. In NIPS, 2014.
[12] W. Guo, H.-L. Zhen, X. Li, W. Luo, M. Yuan, Y. Jin, and J. Yan. Machine learning methods in solving the boolean satisfiability problem. *Machine Intelligence Research*, pages 1–16, 2023.
[13] M. Hanan. On steiner's problem with rectilinear distance. SIAM Journal on Applied mathematics, 14(2):255-265, 1966.
[14] K. He, X. Zhang, S. Ren, and J. Sun. Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 770-778, 2016.
[15] M. Heusel, H. Ramsauer, T. Unterthiner, B. Nessler, and S. Hochreiter. Gans trained by a two time-scale update rule converge to a local nash equilibrium. Advances in neural information processing systems, 30, 2017.
[16] J. Ho, A. Jain, and P. Abbeel. Denoising diffusion probabilistic models. Advances in Neural Information Processing Systems, 33:6840-6851, 2020.
[17] J. Ho and T. Salimans. Classifier-free diffusion guidance. In NeurIPS 2021 Workshop on Deep Generative Models and Downstream Applications, 2021.
[18] J.-M. Ho, G. Vijayan, and C.-K. Wong. New algorithms for the rectilinear steiner tree problem. IEEE transactions on computer-aided design of integrated circuits and systems, 9(2):185-193, 1990.
[19] K. Honda, R. Yonetani, M. Nishimura, and T. Kozuno. When to replan? an adaptive replanning strategy for autonomous navigation using deep reinforcement learning. arXiv preprint arXiv:2304.12046, 2023.