A Reinforcement Learning Agent for Obstacle-Avoiding Rectilinear Steiner Tree Construction-Reference-Cited by-同舟云学术

A Reinforcement Learning Agent for Obstacle-Avoiding Rectilinear Steiner Tree Construction

Published:2022-04-13 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2022 International Symposium on Physical Design
language:
Short-container-title:

Author:

Chen Po-Yan¹,Ke Bing-Ting¹,Lee Tai-Cheng¹,Tsai I-Ching²,Kung Tai-Wei²,Lin Li-Yi²,Liu En-Cheng²,Chang Yun-Chih²,Li Yih-Lang¹,Chao Mango C.-T.¹

Affiliation:

1. National Yang Ming Chiao Tung University, Hsinchu, Taiwan Roc

2. Realtek Semiconductor Corporation, Hsinchu, Taiwan Roc

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3505170.3506721

Reference21 articles.

1. The Rectilinear Steiner Tree Problem is $NP$-Complete

2. Z. Shen Steiner tree construction with rectilinear blockages," in Proc . ICCD , 2005 , pp. 38 -- 44 . Z. Shen et al., "Efficient rectilinear Steiner tree construction with rectilinear blockages," in Proc. ICCD, 2005, pp. 38--44.

3. Obstacle avoiding rectilinear Steiner tree construction based on spanning graphs;Lin C. W.;IEEE TCAD,2008

4. EBOARST: An efficient edge-based obstacle-avoiding rectilinear Steiner tree construction algorithm;Long J. Y.;IEEE TCAD,2008

5. Multilayer obstacle-avoiding rectilinear Steiner tree construction based on spanning graphs;Lin C.-W.;IEEE TCAD,2008

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Rule-Based High Efficient Obstacle-Avoiding RSMT Algorithm for VLSI Routing;2024 IEEE International Symposium on Circuits and Systems (ISCAS);2024-05-19

2. Timing-Driven Obstacle-Avoiding X-Architecture Steiner Minimum Tree Algorithm With Slack Constraints;IEEE Transactions on Systems, Man, and Cybernetics: Systems;2024-05

3. Beyond games: a systematic review of neural Monte Carlo tree search applications;Applied Intelligence;2023-12-28

4. Deep-Steiner: Learning to Solve the Euclidean Steiner Tree Problem;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2023