{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T06:44:02Z","timestamp":1751093042455,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T00:00:00Z","timestamp":1336003200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,3]]},"DOI":"10.1145\/2206781.2206848","type":"proceedings-article","created":{"date-parts":[[2012,5,7]],"date-time":"2012-05-07T18:47:53Z","timestamp":1336416473000},"page":"275-278","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Density-reduction-oriented layer assignment for rectangle escape routing"],"prefix":"10.1145","author":[{"given":"Jin-Tai","family":"Yan","sequence":"first","affiliation":[{"name":"Chung Hua University, Hsinchu, Taiwan Roc"}]},{"given":"Jun-Min","family":"Chung","sequence":"additional","affiliation":[{"name":"Chung Hua university, Hsinchu, Taiwan Roc"}]},{"given":"Zhi-Wei","family":"Chen","sequence":"additional","affiliation":[{"name":"Chung Hua University, Hsinchu, Taiwan Roc"}]}],"member":"320","published-online":{"date-parts":[[2012,5,3]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"390","volume-title":"Optimal bus sequencing for escape routing in dense PCBs,\" International Conference on Computer-Aided Design","author":"Kong H.","year":"2007","unstructured":"H. Kong , T. Yan , D. F. Wong and M. M. Ozdal , \" Optimal bus sequencing for escape routing in dense PCBs,\" International Conference on Computer-Aided Design , pp. 390 -- 395 , 2007 . H. Kong, T. Yan, D. F. Wong and M. M. Ozdal, \"Optimal bus sequencing for escape routing in dense PCBs,\" International Conference on Computer-Aided Design, pp.390--395, 2007."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630000"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687444"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1973009.1973050"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837326"},{"key":"e_1_3_2_1_6_1","first-page":"843","volume-title":"A provably good approximation algorithm for rectangle escape problem with application to PCB routing,\" Asia and South Pacific Design Automation Conference","author":"Ma Q.","year":"2011","unstructured":"Q. Ma , H. Kong , D. F. Wong and F. Y. Young , \" A provably good approximation algorithm for rectangle escape problem with application to PCB routing,\" Asia and South Pacific Design Automation Conference , pp. 843 -- 848 , 2011 . Q. Ma, H. Kong, D. F. Wong and F. Y. Young, \"A provably good approximation algorithm for rectangle escape problem with application to PCB routing,\" Asia and South Pacific Design Automation Conference, pp.843--848, 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/800158.805069"},{"key":"e_1_3_2_1_8_1","unstructured":"lp_solve: an open source linear programming solver. {Online}. Available: http:\/\/sourceforge.net\/projects\/lpsolve  lp_solve: an open source linear programming solver. {Online}. Available: http:\/\/sourceforge.net\/projects\/lpsolve"}],"event":{"name":"GLSVLSI '12: Great Lakes Symposium on VLSI 2012","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CEDA","IEEE CASS"],"location":"Salt Lake City Utah USA","acronym":"GLSVLSI '12"},"container-title":["Proceedings of the great lakes symposium on VLSI"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2206781.2206848","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2206781.2206848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2206781.2206848"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,3]]},"references-count":8,"alternative-id":["10.1145\/2206781.2206848","10.1145\/2206781"],"URL":"https:\/\/doi.org\/10.1145\/2206781.2206848","relation":{},"subject":[],"published":{"date-parts":[[2012,5,3]]},"assertion":[{"value":"2012-05-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}