{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T06:09:12Z","timestamp":1758089352667,"version":"3.44.0"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/dac63849.2025.11133098","type":"proceedings-article","created":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T17:35:41Z","timestamp":1757957741000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["PatLabor: Pareto Optimization of Timing-Driven Routing Trees"],"prefix":"10.1109","author":[{"given":"Zhiyang","family":"Chen","sequence":"first","affiliation":[{"name":"Tsinghua University"}]},{"given":"Hailong","family":"Yao","sequence":"additional","affiliation":[{"name":"University of Science and Technology Beijing"}]},{"given":"Xia","family":"Yin","sequence":"additional","affiliation":[{"name":"Tsinghua University"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/nature13570"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3177540.3178239"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3649329.3656530"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.907068"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2894653"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323981"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0130013"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/43.144853"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586209"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758762"},{"article-title":"A heuristic algorithm for the rectilinear Steiner arborescence problem","year":"1994","author":"Crdova","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.1997.621429"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704371353"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.18"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/43.137519"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294129"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0149-4"},{"key":"ref19","first-page":"164","article-title":"TreeNet: Deep point cloud embedding for routing tree construction","volume-title":"Asia and South Pacific Design Automation Conference","author":"Li"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0114025"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2020.1028"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1562764.1562785"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010302"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(72)90045-2"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230240303"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"volume-title":"Reinforcement Learning and Optimal Control","year":"2019","author":"Bertsekas","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553380"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/15M1050276"}],"event":{"name":"2025 62nd ACM\/IEEE Design Automation Conference (DAC)","start":{"date-parts":[[2025,6,22]]},"location":"San Francisco, CA, USA","end":{"date-parts":[[2025,6,25]]}},"container-title":["2025 62nd ACM\/IEEE Design Automation Conference (DAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11132383\/11132091\/11133098.pdf?arnumber=11133098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T05:47:39Z","timestamp":1758001659000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11133098\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/dac63849.2025.11133098","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}