{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:52:43Z","timestamp":1758268363432,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,23]]},"DOI":"10.1145\/3649329.3656500","type":"proceedings-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:27:22Z","timestamp":1731007642000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Arbitrary-size Multi-layer OARSMT RL Router Trained with Combinatorial Monte-Carlo Tree Search"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-3189-2202","authenticated-orcid":false,"given":"Liang-Ting","family":"Chen","sequence":"first","affiliation":[{"name":"Institute of Electronics, National Yang Ming Chiao Tung University, Hsinchu, Taiwan, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5815-856X","authenticated-orcid":false,"given":"Hung-Ru","family":"Kuo","sequence":"additional","affiliation":[{"name":"Institute of Electronics, National Yang Ming Chiao Tung University, Hsinchu, Taiwan, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6441-2392","authenticated-orcid":false,"given":"Yih-Lang","family":"Li","sequence":"additional","affiliation":[{"name":"National Yang Ming Chiao Tung University, Hsin Chu, Taiwan, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7299-9015","authenticated-orcid":false,"given":"Mango C.-T.","family":"Chao","sequence":"additional","affiliation":[{"name":"Institute of Electronics, National Yang Ming Chiao Tung University, Hsinchu, Taiwan, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"volume-title":"Proc. of ISPD '19","author":"Gaurav","key":"e_1_3_2_1_1_1","unstructured":"Gaurav Ajwani et al. 2010. FOARS: FLUTE based obstacle-avoiding rectilinear Steiner tree construction. In Proc. of ISPD '19. 27--34."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v4i1.18700"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. of ISPD","author":"Hao","year":"2023","unstructured":"Hao Chen et al. 2023. Reinforcement Learning Guided Detailed Routing for Custom Circuits. In Proc. of ISPD 2023. ACM, 26--34."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of ISPD","author":"Po-Yan","year":"2022","unstructured":"Po-Yan Chen et al. 2022. A Reinforcement Learning Agent for Obstacle-Avoiding Rectilinear Steiner Tree Construction. In Proc. of ISPD 2022. ACM, 107--115."},{"key":"e_1_3_2_1_5_1","first-page":"70","article-title":"FLUTE: Fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design","volume":"27","author":"Chris Chu","year":"2007","unstructured":"Chris Chu et al. 2007. FLUTE: Fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design. IEEE TCAD 27, 1 (2007), 70--83.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Upma Gandhi et al. 2019. A reinforcement learning-based framework for solving physical design routing problem in the absence of large test sets. In 2019 ACM\/IEEE MLCAD. IEEE 1--6.","DOI":"10.1109\/MLCAD48534.2019.9142109"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0114025"},{"volume-title":"Proc. of IEEE CVPR. 770--778","author":"Kaiming","key":"e_1_3_2_1_8_1","unstructured":"Kaiming He et al. 2016. Deep residual learning for image recognition. In Proc. of IEEE CVPR. 770--778."},{"volume-title":"Circuit Routing Using Monte Carlo Tree Search and Deep Reinforcement Learning. In 2022 Int. Symp. VLSI-DAT. 1--5.","author":"Youbiao","key":"e_1_3_2_1_9_1","unstructured":"Youbiao He et al. 2022. Circuit Routing Using Monte Carlo Tree Search and Deep Reinforcement Learning. In 2022 Int. Symp. VLSI-DAT. 1--5."},{"key":"e_1_3_2_1_10_1","first-page":"718","article-title":"On the construction of optimal obstacle-avoiding rectilinear Steiner minimum trees","volume":"30","author":"Tao Huang","year":"2011","unstructured":"Tao Huang et al. 2011. On the construction of optimal obstacle-avoiding rectilinear Steiner minimum trees. IEEE TCAD 30, 5 (2011), 718--731.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_11_1","first-page":"882","article-title":"ObSteiner: an exact algorithm for the construction of rectilinear Steiner minimum trees in the presence of complex rectilinear obstacles","volume":"32","author":"Tao Huang","year":"2013","unstructured":"Tao Huang et al. 2013. ObSteiner: an exact algorithm for the construction of rectilinear Steiner minimum trees in the presence of complex rectilinear obstacles. IEEE TCAD 32, 6 (2013), 882--893.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_12_1","first-page":"2007","article-title":"Multilayer obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs","volume":"27","author":"Lin Chung-Wei","year":"2008","unstructured":"Chung-Wei Lin et al. 2008. Multilayer obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs. IEEE TCAD 27, 11 (2008), 2007--2016.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_13_1","first-page":"643","article-title":"Obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs","volume":"27","author":"Lin Chung-Wei","year":"2008","unstructured":"Chung-Wei Lin et al. 2008. Obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs. IEEE TCAD 27, 4 (2008), 643--653.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_14_1","first-page":"1","article-title":"A maze routing-based methodology with bounded exploration and path-assessed retracing for constrained multilayer obstacle-avoiding rectilinear Steiner tree construction","volume":"23","author":"Lin Kuen-Wey","year":"2018","unstructured":"Kuen-Wey Lin et al. 2018. A maze routing-based methodology with bounded exploration and path-assessed retracing for constrained multilayer obstacle-avoiding rectilinear Steiner tree construction. TODAES 23, 4 (2018), 1--26.","journal-title":"TODAES"},{"key":"e_1_3_2_1_15_1","first-page":"1050","article-title":"Obstacle-avoiding rectilinear Steiner tree construction: A Steiner-point-based algorithm","volume":"31","author":"Liu Chih-Hung","year":"2012","unstructured":"Chih-Hung Liu et al. 2012. Obstacle-avoiding rectilinear Steiner tree construction: A Steiner-point-based algorithm. IEEE TCAD 31, 7 (2012), 1050--1060.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2363390"},{"key":"e_1_3_2_1_17_1","volume-title":"REST: Constructing Rectilinear Steiner Minimum Tree via Reinforcement Learning. In 2021 58th ACM\/IEEE DAC. 1135--1140.","author":"Jinwei Liu","year":"2021","unstructured":"Jinwei Liu et al. 2021. REST: Constructing Rectilinear Steiner Minimum Tree via Reinforcement Learning. In 2021 58th ACM\/IEEE DAC. 1135--1140."},{"key":"e_1_3_2_1_18_1","first-page":"2169","article-title":"EBOARST: An efficient edge-based obstacle-avoiding rectilinear Steiner tree construction algorithm","volume":"27","author":"Jieyi Long","year":"2008","unstructured":"Jieyi Long et al. 2008. EBOARST: An efficient edge-based obstacle-avoiding rectilinear Steiner tree construction algorithm. IEEE TCAD 27, 12 (2008), 2169--2182.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_19_1","volume-title":"Proc. of MICCAI","author":"Olaf","year":"2015","unstructured":"Olaf Ronneberger et al. 2015. U-net: Convolutional networks for biomedical image segmentation. In Proc. of MICCAI 2015. Springer, 234--241."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-011-9258-6"},{"key":"e_1_3_2_1_21_1","unstructured":"John Schulman et al. 2017. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)."},{"key":"e_1_3_2_1_22_1","volume-title":"ICCD","author":"Zion","year":"2005","unstructured":"Zion Shen et al. 2005. Efficient rectilinear Steiner tree construction with rectilinear blockages. In ICCD 2005. IEEE, 38--44."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"David Silver et al. 2017. Mastering the game of go without human knowledge. nature 550 7676 (2017) 354--359.","DOI":"10.1038\/nature24270"},{"key":"e_1_3_2_1_24_1","volume-title":"ICCV","author":"Du","year":"2015","unstructured":"Du Tran et al. 2015. Learning spatiotemporal features with 3d convolutional networks. In ICCV 2015. 4489--4497."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"David M Warme et al. 2000. Exact algorithms for plane Steiner tree problems: A computational study. In Advances in Steiner trees. Springer 81--116.","DOI":"10.1007\/978-1-4757-3171-2_6"},{"key":"e_1_3_2_1_26_1","volume-title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning 8","author":"Williams Ronald J","year":"1992","unstructured":"Ronald J Williams. 1992. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine learning 8 (1992), 229--256."}],"event":{"name":"DAC '24: 61st ACM\/IEEE Design Automation Conference","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"],"location":"San Francisco CA USA","acronym":"DAC '24"},"container-title":["Proceedings of the 61st ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3656500","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3656500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:55Z","timestamp":1750295875000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3656500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":26,"alternative-id":["10.1145\/3649329.3656500","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3656500","relation":{},"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"2024-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}