{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T15:45:51Z","timestamp":1777045551861,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T00:00:00Z","timestamp":1257120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0540998"],"award-info":[{"award-number":["CCF-0540998"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,11,2]]},"DOI":"10.1145\/1687399.1687465","type":"proceedings-article","created":{"date-parts":[[2010,1,5]],"date-time":"2010-01-05T15:05:14Z","timestamp":1262703914000},"page":"344-350","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["CROP"],"prefix":"10.1145","author":[{"given":"Yanheng","family":"Zhang","sequence":"first","affiliation":[{"name":"Iowa State University, Ames, IA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Chu","sequence":"additional","affiliation":[{"name":"Iowa State University, Ames, IA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,11,2]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"ISPD05 placement contest benchmarks. http:\/\/www.sigda.org\/ispd2005\/contest.htm.  ISPD05 placement contest benchmarks. http:\/\/www.sigda.org\/ispd2005\/contest.htm."},{"key":"e_1_3_2_1_2_1","unstructured":"ISPD06 placement contest benchmarks. http:\/\/www.sigda.org\/ispd2006\/contest.htm.  ISPD06 placement contest benchmarks. http:\/\/www.sigda.org\/ispd2006\/contest.htm."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1266366.1266632"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391469.1391513"},{"key":"e_1_3_2_1_5_1","first-page":"212","volume-title":"Proc. Intl. Conf. on Computer-Aided Design","author":"Tsota K.","year":"2008","unstructured":"K. Tsota , C. Koh , and V. Balakrishnan . Guiding global placement with wire density . In Proc. Intl. Conf. on Computer-Aided Design , pages 212 -- 217 , 2008 . K. Tsota, C. Koh, and V. Balakrishnan. Guiding global placement with wire density. In Proc. Intl. Conf. on Computer-Aided Design, pages 212--217, 2008."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.809660"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.884575"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/505388.505391"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278480.1278496"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2007.357994"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/981066.981072"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.888260"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2007.357975"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.923063"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055185"},{"key":"e_1_3_2_1_16_1","first-page":"576","volume-title":"Proc. Asia and South Pacific Design Automation Conf.","author":"Xu Y.","year":"2009","unstructured":"Y. Xu , Y. Zhang , and C. Chu . FastRoute 4.0: Global router with efficient via minimization . In Proc. Asia and South Pacific Design Automation Conf. , pages 576 -- 581 , 2009 . Y. Xu, Y. Zhang, and C. Chu. FastRoute 4.0: Global router with efficient via minimization. In Proc. Asia and South Pacific Design Automation Conf., pages 576--581, 2009."},{"key":"e_1_3_2_1_17_1","unstructured":"ISPD07 global routing contest benchmarks. http:\/\/www.sigda.org\/ispd2007\/contest.htm.  ISPD07 global routing contest benchmarks. http:\/\/www.sigda.org\/ispd2007\/contest.htm."},{"key":"e_1_3_2_1_18_1","unstructured":"ISPD08 global routing contest benchmarks. http:\/\/www.sigda.org\/ispd2008\/contest.htm.  ISPD08 global routing contest benchmarks. http:\/\/www.sigda.org\/ispd2008\/contest.htm."},{"key":"e_1_3_2_1_19_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . Freeman , NY , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, NY, 1979."},{"key":"e_1_3_2_1_20_1","first-page":"48","volume-title":"Proc. Intl. Conf. on Computer-Aided Design","author":"Pan M.","year":"2005","unstructured":"M. Pan , N. Viswanathan , and C. Chu . An efficient and effective detailed placement algorithm . In Proc. Intl. Conf. on Computer-Aided Design , pages 48 -- 55 , 2005 . M. Pan, N. Viswanathan, and C. Chu. An efficient and effective detailed placement algorithm. In Proc. Intl. Conf. on Computer-Aided Design, pages 48--55, 2005."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1509456.1509536"}],"event":{"name":"ICCAD '09: The International Conference on Computer-Aided Design","location":"San Jose California","acronym":"ICCAD '09","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CAS","IEEE Council on Electronic Design Automation (CEDA)"]},"container-title":["Proceedings of the 2009 International Conference on Computer-Aided Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1687399.1687465","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1687399.1687465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:01Z","timestamp":1750278361000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1687399.1687465"}},"subtitle":["fast and effective congestion refinement of placement"],"short-title":[],"issued":{"date-parts":[[2009,11,2]]},"references-count":21,"alternative-id":["10.1145\/1687399.1687465","10.1145\/1687399"],"URL":"https:\/\/doi.org\/10.1145\/1687399.1687465","relation":{},"subject":[],"published":{"date-parts":[[2009,11,2]]},"assertion":[{"value":"2009-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}