{"title":"有障碍物的多层蜂窝间路由","authors":"Hsiao-Ping Tseng, C. Sechen","doi":"10.1109/CICC.1997.606690","DOIUrl":null,"url":null,"abstract":"In this paper we present the first multi-layer graph-based router which can handle obstacles on any layer. We show that it improves the performance of a maze router with rip-up and reroute (RR) when obstacles are present. The graph-based router combined with a maze router with RR has yielded the best reported routing results for multi-layer problems with or without obstacles on any layer.","PeriodicalId":111737,"journal":{"name":"Proceedings of CICC 97 - Custom Integrated Circuits Conference","volume":"125 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multi-layer over-the-cell routing with obstacles\",\"authors\":\"Hsiao-Ping Tseng, C. Sechen\",\"doi\":\"10.1109/CICC.1997.606690\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present the first multi-layer graph-based router which can handle obstacles on any layer. We show that it improves the performance of a maze router with rip-up and reroute (RR) when obstacles are present. The graph-based router combined with a maze router with RR has yielded the best reported routing results for multi-layer problems with or without obstacles on any layer.\",\"PeriodicalId\":111737,\"journal\":{\"name\":\"Proceedings of CICC 97 - Custom Integrated Circuits Conference\",\"volume\":\"125 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-05-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of CICC 97 - Custom Integrated Circuits Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CICC.1997.606690\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of CICC 97 - Custom Integrated Circuits Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICC.1997.606690","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we present the first multi-layer graph-based router which can handle obstacles on any layer. We show that it improves the performance of a maze router with rip-up and reroute (RR) when obstacles are present. The graph-based router combined with a maze router with RR has yielded the best reported routing results for multi-layer problems with or without obstacles on any layer.