[20] F. K. Hwang. On steiner minimal trees with rectilinear distance. SIAM journal on Applied Mathematics, 30(1):104-114, 1976.
[21] F. K. Hwang. An o (n log n) algorithm for rectilinear minimal spanning trees. Journal of the ACM (JACM), 26(2):177-182, 1979.
[22] P. Isola, J.-Y. Zhu, T. Zhou, and A. A. Efros. Image-to-image translation with conditional adversarial networks. In Proceedings of the IEEE conference on computer vision and pattern recognition, pages 1125-1134, 2017.
[23] A. B. Kahng, I. I. Mandoiu, and A. Z. Zelikovsky. Highly scalable algorithms for rectilinear and octilinear steiner trees. In Proceedings of the 2003 Asia and South Pacific Design Automation Conference, pages 827-833, 2003.
[24] R. Kastner, E. Bozorgzadeh, and M. Sarrafzadeh. Pattern routing: Use and theory for increasing predictability and avoiding coupling. TCAD, 2002.
[25] D. P. Kingma and J. Ba. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014.
[26] D. P. Kingma and M. Welling. Auto-encoding variational bayes. In ICLR, 2014.
[27] M. Kramer and J. Van Leeuwen. The complexity of wirerouting and finding minimum area layouts for arbitrary vlsi circuits. Adv. Comput. Res, 2:129-146, 1984.
[28] Y. Lai, Y. Mu, and P. Luo. Maskplace: Fast chip placement via reinforced visual representation learning. arXiv preprint arXiv:2211.13382, 2022.
[29] Y. Li, J. Guo, R. Wang, and J. Yan. From distribution learning in training to gradient search in testing for combinatorial optimization. In Advances in Neural Information Processing Systems, 2023.
[30] Y. Li, L. Shi, and J. Yan. Iid-gan: an iid sampling perspective for regularizing mode collapse. In E. Elkind, editor, Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI-23, pages 3929–3938. International Joint Conferences on Artificial Intelligence Organization, 8 2023. Main Track.
[31] H. Liao, W. Zhang, X. Dong, B. Poczos, K. Shimada, and L. Burak Kara. A deep reinforcement learning approach for global routing. Journal of Mechanical Design, 142(6), 2020.
[32] Y. Lin, S. Dhar, W. Li, H. Ren, B. Khailany, and D. Z. Pan. Dreamplace: Deep learning toolkit-enabledgpu acceleration for modern vlsi placement. In Proceedings of the 56th Annual Design Automation Conference, pages 1-6, 2019.
[33] J. Liu, G. Chen, and E. F. Young. Rest: Constructing rectilinear steiner minimum tree via reinforcement learning. In 2021 58th ACM/IEEE Design Automation Conference (DAC), pages 1135-1140. IEEE, 2021.
[34] W.-H. Liu, W.-C. Kao, Y.-L. Li, and K.-Y. Chao. Nctu-gr 2.0: Multithreaded collision-aware global routing with bounded-length maze routing. IEEE Transactions on computer-aided design of integrated circuits and systems, 32(5):709-722, 2013.
[35] S. Mahboubi, H. Ninomiya, T. Kamio, H. Asai, et al. A nesterov's accelerated quasi-newton method for global routing using deep reinforcement learning. Nonlinear Theory and Its Applications, IEICE, 12(3):323-335, 2021.
[36] L. McMurchie and C. Ebeling. Pathfinder: A negotiation-based performance-driven router for fpgas. In Proceedings of the 1995 ACM third international symposium on Field-programmable gate arrays, pages 111-117, 1995.
[37] M. Mirza and S. Osindero. Conditional generative adversarial nets. arXiv preprint arXiv:1411.1784, 2014.
[38] G.-J. Nam, M. Yildiz, D. Pan, and P. Madden. Ispd 2007 global routing contest. 2007.