{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:19Z","timestamp":1750306639026,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"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":[[2014,6]]},"DOI":"10.1145\/2633948.2633952","type":"proceedings-article","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T20:33:47Z","timestamp":1407962027000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["UI-Route"],"prefix":"10.1145","author":[{"given":"Tsung-Wei","family":"Huang","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, IL, USA"}]},{"given":"Pei-Ci","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, IL, USA"}]},{"given":"Martin D. F.","family":"Wong","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,6]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"GPPC 2013: Grid-Based Path Planning Competition Moving AI Lab. http:\/\/movingai.com\/GPPC\/  GPPC 2013: Grid-Based Path Planning Competition Moving AI Lab. http:\/\/movingai.com\/GPPC\/"},{"key":"e_1_3_2_1_2_1","volume-title":"Handbook of Algorithms for Physical Design Automation,\" CRC Press","author":"Alpert C. J.","year":"2009","unstructured":"C. J. Alpert , D. P. Mehta , and S. S. Sapatnekar , \" Handbook of Algorithms for Physical Design Automation,\" CRC Press , 2009 . C. J. Alpert, D. P. Mehta, and S. S. Sapatnekar, \"Handbook of Algorithms for Physical Design Automation,\" CRC Press, 2009."},{"key":"e_1_3_2_1_3_1","first-page":"27","volume-title":"IEEE symp. on CIG","author":"Cazenave T.","year":"2006","unstructured":"T. Cazenave , \" Optimizations of Data Structures , Heuristics and Algorithms for Path-finding on Maps ,\" IEEE symp. on CIG , pp. 27 -- 33 , 2006 . T. Cazenave, \"Optimizations of Data Structures, Heuristics and Algorithms for Path-finding on Maps,\" IEEE symp. on CIG, pp. 27--33, 2006."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070404"},{"key":"e_1_3_2_1_5_1","volume-title":"AAAI","author":"Harabor D.","year":"2011","unstructured":"D. Harabor and A. Grastien , \" Online Graph Pruning for Pathfinding on Grid Maps,\" Prof . AAAI , 2011 . D. Harabor and A. Grastien, \"Online Graph Pruning for Pathfinding on Grid Maps,\" Prof. AAAI, 2011."},{"key":"e_1_3_2_1_6_1","first-page":"100","volume":"4","author":"Hart P. E.","year":"1968","unstructured":"P. E. Hart , N. J. Nilsson , B. Raphael , \" A Formal Basis for the Heuristic Determination of Minimum Cost Paths ,\" IEEE Trans. on SSC , vol. 4 , pp. 100 -- 107 , 1968 . P. E. Hart, N. J. Nilsson, B. Raphael, \"A Formal Basis for the Heuristic Determination of Minimum Cost Paths,\" IEEE Trans. on SSC, vol. 4, pp. 100--107, 1968.","journal-title":"IEEE Trans. on SSC"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/800260.809014"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-90-481-9591-6","volume-title":"VLSI Physical Design: From Graph Partitioning to Timing Closure,\" Springer","author":"Kahng A. B.","year":"2011","unstructured":"A. B. Kahng , J. Lienig , I. L. Markov , and J. Hu , \" VLSI Physical Design: From Graph Partitioning to Timing Closure,\" Springer , 2011 . A. B. Kahng, J. Lienig, I. L. Markov, and J. Hu, \"VLSI Physical Design: From Graph Partitioning to Timing Closure,\" Springer, 2011."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219222"},{"key":"e_1_3_2_1_10_1","first-page":"1475","author":"Mikami K.","year":"1968","unstructured":"K. Mikami and K. Tabuchi , \"A Computer Program for Optimal Routing of Printed Circuit Connectors,\" Proc. Int. Federation for Information Processing , pp. 1475 -- 1478 , 1968 . K. Mikami and K. Tabuchi, \"A Computer Program for Optimal Routing of Printed Circuit Connectors,\" Proc. Int. Federation for Information Processing, pp. 1475--1478, 1968.","journal-title":"Int. Federation for Information Processing"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1123008.1123042"},{"key":"e_1_3_2_1_12_1","first-page":"100","volume-title":"Proc. ACM\/IEEE DAC","author":"Soukup J.","year":"1978","unstructured":"J. Soukup , \" Fast Maze Router ,\" Proc. ACM\/IEEE DAC , pp. 100 -- 102 , 1978 J. Soukup, \"Fast Maze Router,\" Proc. ACM\/IEEE DAC, pp. 100--102, 1978"},{"key":"e_1_3_2_1_13_1","first-page":"144","volume":"4","author":"Sturtevant N. R.","year":"2012","unstructured":"N. R. Sturtevant , \" Benchmarks for Grid-Based Pathfinding ,\" IEEE Trans. on CIAIG , vol. 4 , pp. 144 -- 148 , 2012 N. R. Sturtevant, \"Benchmarks for Grid-Based Pathfinding,\" IEEE Trans. on CIAIG, vol. 4, pp. 144--148, 2012","journal-title":"IEEE Trans. on CIAIG"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1960397.1960429"},{"key":"e_1_3_2_1_15_1","volume-title":"Synthesis, Verification, and Testing,\" Elsevier","author":"Wang L.-T.","year":"2009","unstructured":"L.-T. Wang , Y.-W. Chang , and K.-T. Cheng , \" Electronic Design Automation : Synthesis, Verification, and Testing,\" Elsevier , 2009 . L.-T. Wang, Y.-W. Chang, and K.-T. Cheng, \"Electronic Design Automation: Synthesis, Verification, and Testing,\" Elsevier, 2009."}],"event":{"name":"SLIP '14: System Level Interconnect Prediction Workshop","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CS"],"location":"San Francisco CA USA","acronym":"SLIP '14"},"container-title":["Proceedings of SLIP (System Level Interconnect Prediction) on System Level Interconnect Prediction Workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2633948.2633952","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2633948.2633952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:56Z","timestamp":1750229756000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2633948.2633952"}},"subtitle":["An Ultra-Fast Incremental Maze Routing Algorithm"],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":15,"alternative-id":["10.1145\/2633948.2633952","10.1145\/2633948"],"URL":"https:\/\/doi.org\/10.1145\/2633948.2633952","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]},"assertion":[{"value":"2014-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}