{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:34:21Z","timestamp":1773246861903,"version":"3.50.1"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T00:00:00Z","timestamp":1698451200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T00:00:00Z","timestamp":1698451200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,10,28]]},"DOI":"10.1109\/iccad57390.2023.10323981","type":"proceedings-article","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T18:58:45Z","timestamp":1701370725000},"page":"1-9","source":"Crossref","is-referenced-by-count":12,"title":["Towards Timing-Driven Routing: An Efficient Learning Based Geometric Approach"],"prefix":"10.1109","author":[{"given":"Liying","family":"Yang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guowei","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Data Science, University of Science and Technology of China,Anhui,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Ding","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-9591-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1063\/1.1697872"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/43.391737"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3505170.3511477"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0114025"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0130013"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3171-2_6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/640000.640034"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2003.1195132"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.907068"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586209"},{"key":"ref12","first-page":"780","article-title":"The rectilinear steiner arborescence problem is np-complete","author":"Shi","year":"2000","journal-title":"SODA"},{"key":"ref13","article-title":"A heuristic algorithm for the recti-linear steiner arborescence problem","author":"Cordova","year":"1994","journal-title":"CIS Department, Univ. of Florida, Tech. Rep. TR-94\u2013025"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/157485.165065"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2007.357993"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/43.137519"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294129"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2894653"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3451179"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3508352.3549434","article-title":"Gpu-accelerated rectilinear steiner tree generation","volume-title":"Proceedings of the 41st IEEE\/ACM International Conference on Computer-Aided Design","author":"Guo","year":"2022"},{"key":"ref22","first-page":"1928","article-title":"Asynchronous methods for deep reinforcement learning","volume-title":"International conference on machine learning. PMLR","author":"Mnih","year":"2016"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313077"},{"key":"ref24","author":"Mehlhorn","year":"1994","journal-title":"Implementation of a sweep line algorithm for the straight \\ & line segment intersection problem"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref26","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv preprint"},{"key":"ref27","article-title":"Graph attention networks","author":"Velickovic","year":"2017","journal-title":"arXiv preprint"},{"key":"ref28","article-title":"Graph neural networks exponentially lose expressive power for node classification","author":"Oono","year":"2019","journal-title":"arXiv preprint"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2977661"},{"key":"ref30","volume-title":"Computational geometry algorithms and applications","author":"Mark","year":"2008"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0149-4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/VDAT.2008.4542405"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415530"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/iccad.2015.7372671"}],"event":{"name":"2023 IEEE\/ACM International Conference on Computer Aided Design (ICCAD)","location":"San Francisco, CA, USA","start":{"date-parts":[[2023,10,28]]},"end":{"date-parts":[[2023,11,2]]}},"container-title":["2023 IEEE\/ACM International Conference on Computer Aided Design (ICCAD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10323590\/10323543\/10323981.pdf?arnumber=10323981","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T22:19:36Z","timestamp":1709417976000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10323981\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,28]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/iccad57390.2023.10323981","relation":{},"subject":[],"published":{"date-parts":[[2023,10,28]]}}}