{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T15:19:30Z","timestamp":1782314370313,"version":"3.54.5"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T00:00:00Z","timestamp":1680652800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T00:00:00Z","timestamp":1680652800000},"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,4,5]]},"DOI":"10.1109\/isqed57927.2023.10129354","type":"proceedings-article","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T17:33:09Z","timestamp":1684949589000},"page":"1-7","source":"Crossref","is-referenced-by-count":8,"title":["MC-MCF: A Multi-Capacity Model for Ordered Escape Routing"],"prefix":"10.1109","author":[{"given":"Zhenyi","family":"Gao","sequence":"first","affiliation":[{"name":"Tsinghua University,Department of Computer Science & Technology,Beijing"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sheqin","family":"Dong","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Computer Science & Technology,Beijing"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhicong","family":"Tang","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Computer Science & Technology,Beijing"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjian","family":"Yu","sequence":"additional","affiliation":[{"name":"Tsinghua University,Department of Computer Science & Technology,Beijing"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","first-page":"384","article-title":"Ordered escape routing for grid pin array based on min-cost multi-commodity flow","author":"jiao","year":"2016","journal-title":"Proc ASP-DAC"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICARA.2015.7081209"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3453688.3461483"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3386263.3406942"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1785481.1785579"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2009.4796545"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/6040.883759"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2010.5654190"},{"key":"ref17","year":"0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2451916.2451941"},{"key":"ref18","first-page":"1356","article-title":"Np-completeness and an approximation algorithm for rectangle escape problem with application to pcb routing","volume":"9","author":"ma","year":"2012","journal-title":"IEEE Trans Computer-Aided Design"},{"key":"ref8","first-page":"606","article-title":"An integer linear programming based routing algorithm for flip-chip design","author":"fang","year":"2007","journal-title":"Proc DAC"},{"key":"ref7","first-page":"6","article-title":"Monotonic parallel and orthogonal routing for single-layer ball grid array packages","author":"tomioka","year":"2006","journal-title":"Proc ASP-DAC"},{"key":"ref9","first-page":"244","article-title":"Ordered escape routing based on boolean satisfiability","author":"luo","year":"2008","journal-title":"Proc ASP-DAC"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1145\/1629911.1630001","article-title":"a correct network flow model for escape routing","author":"tan yan","year":"2009","journal-title":"2009 46th ACM\/IEEE Design Automation Conference dac"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147162"},{"key":"ref6","first-page":"193","article-title":"Network flow modeling for escape routing on staggered pin arrays","author":"wu","year":"2013","journal-title":"Proc ASP-DAC"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1109\/TCAD.2013.2259539","article-title":"Escape routing for staggered-pin-array pcbs","volume":"32","author":"ho","year":"2013","journal-title":"IEEE Trans Computer-Aided Design"}],"event":{"name":"2023 24th International Symposium on Quality Electronic Design (ISQED)","location":"San Francisco, CA, USA","start":{"date-parts":[[2023,4,5]]},"end":{"date-parts":[[2023,4,7]]}},"container-title":["2023 24th International Symposium on Quality Electronic Design (ISQED)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10129281\/10129282\/10129354.pdf?arnumber=10129354","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T17:44:53Z","timestamp":1687196693000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10129354\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,5]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isqed57927.2023.10129354","relation":{},"subject":[],"published":{"date-parts":[[2023,4,5]]}}}