{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T00:23:32Z","timestamp":1767831812039,"version":"3.49.0"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1109\/aspdac.2011.5722308","type":"proceedings-article","created":{"date-parts":[[2011,3,5]],"date-time":"2011-03-05T07:54:28Z","timestamp":1299311668000},"page":"843-848","source":"Crossref","is-referenced-by-count":12,"title":["A provably good approximation algorithm for Rectangle Escape Problem with application to PCB routing"],"prefix":"10.1109","author":[{"given":"Qiang","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Kong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin D. F.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangeline F. Y.","family":"Young","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837326"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1147\/rd.464.0397"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1147\/rd.483.0379"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1109\/ICCAD.2007.4397296","article-title":"Optimal bus sequencing for escape routing in dense PCBs","author":"kong","year":"2007","journal-title":"ICCAD '07 Proceedings of the 2007 IEEE\/ACM international conference on Computer-aided design"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630000"},{"key":"ref8","author":"ozdal","year":"2005","journal-title":"Routing algorithms for high-performance VLSI packaging"},{"key":"ref7","first-page":"91","article-title":"Maximum clique problem of rectangle graphs","volume":"1","author":"lee","year":"1983","journal-title":"Advances in Computing Research"},{"key":"ref2","author":"garey","year":"1990","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2005.1560166"},{"key":"ref1","year":"0"}],"event":{"name":"2011 16th Asia and South Pacific Design Automation Conference ASP-DAC 2011","location":"Yokohama, Japan","start":{"date-parts":[[2011,1,25]]},"end":{"date-parts":[[2011,1,28]]}},"container-title":["16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5716646\/5722157\/05722308.pdf?arnumber=5722308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T16:31:48Z","timestamp":1497889908000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5722308\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/aspdac.2011.5722308","relation":{},"subject":[],"published":{"date-parts":[[2011,1]]}}}