{"title":"改进区间线表示法及其在平面布线问题中的应用","authors":"S. Saxena, V. C. Prasad, P. Bhatt","doi":"10.1109/ISVD.1991.185112","DOIUrl":null,"url":null,"abstract":"A modified interval line representation is proposed. This representation makes it possible to speed up some heuristics and algorithms for planar routing problems. This technique is illustrated by speeding up the heuristic proposed by Tsukiyama and Kuh for the double row routing problem. The heuristic suggested by Tsukiyama and Kuh for double row routing problem, can be implemented in O(n/sup 2/rlg r) time algorithm, whereas the implementation suggested by Tsukiyama and Kuh requires O(n/sup 3/r) time. It is also shown that the heuristic can be implemented in parallel in O(lg/sup 2/n+lg r) time using O(N/sup 4/+n/sup 2/r) processors on the concurrent read exclusive write (CREW) model.<<ETX>>","PeriodicalId":183602,"journal":{"name":"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design","volume":"152 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Modified interval line representation and its applications to planar routing problems\",\"authors\":\"S. Saxena, V. C. Prasad, P. Bhatt\",\"doi\":\"10.1109/ISVD.1991.185112\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A modified interval line representation is proposed. This representation makes it possible to speed up some heuristics and algorithms for planar routing problems. This technique is illustrated by speeding up the heuristic proposed by Tsukiyama and Kuh for the double row routing problem. The heuristic suggested by Tsukiyama and Kuh for double row routing problem, can be implemented in O(n/sup 2/rlg r) time algorithm, whereas the implementation suggested by Tsukiyama and Kuh requires O(n/sup 3/r) time. It is also shown that the heuristic can be implemented in parallel in O(lg/sup 2/n+lg r) time using O(N/sup 4/+n/sup 2/r) processors on the concurrent read exclusive write (CREW) model.<<ETX>>\",\"PeriodicalId\":183602,\"journal\":{\"name\":\"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design\",\"volume\":\"152 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-01-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISVD.1991.185112\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVD.1991.185112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Modified interval line representation and its applications to planar routing problems
A modified interval line representation is proposed. This representation makes it possible to speed up some heuristics and algorithms for planar routing problems. This technique is illustrated by speeding up the heuristic proposed by Tsukiyama and Kuh for the double row routing problem. The heuristic suggested by Tsukiyama and Kuh for double row routing problem, can be implemented in O(n/sup 2/rlg r) time algorithm, whereas the implementation suggested by Tsukiyama and Kuh requires O(n/sup 3/r) time. It is also shown that the heuristic can be implemented in parallel in O(lg/sup 2/n+lg r) time using O(N/sup 4/+n/sup 2/r) processors on the concurrent read exclusive write (CREW) model.<>
![[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
