多层避障直线斯坦纳树构造的一种高效算法

DAC Design Automation Conference 2012 Pub Date : 2012-06-03 DOI:10.1145/2228360.2228471

Chih-Hung Liu, I-Che Chen, Der-Tsai Lee

{"title":"多层避障直线斯坦纳树构造的一种高效算法","authors":"Chih-Hung Liu, I-Che Chen, Der-Tsai Lee","doi":"10.1145/2228360.2228471","DOIUrl":null,"url":null,"abstract":"We consider the multi-layer obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) problem and propose a reduction to transform a multi-layer instance into a 3D instance. Based on the reduction we apply computational geometry techniques to develop an efficient algorithm, utilizing existing OARSMT heuristics. Experimental results show that our algorithm provides a solution with excellent quality and has a significant speed-up compared to previously known results.","PeriodicalId":263599,"journal":{"name":"DAC Design Automation Conference 2012","volume":"317 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction\",\"authors\":\"Chih-Hung Liu, I-Che Chen, Der-Tsai Lee\",\"doi\":\"10.1145/2228360.2228471\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the multi-layer obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) problem and propose a reduction to transform a multi-layer instance into a 3D instance. Based on the reduction we apply computational geometry techniques to develop an efficient algorithm, utilizing existing OARSMT heuristics. Experimental results show that our algorithm provides a solution with excellent quality and has a significant speed-up compared to previously known results.\",\"PeriodicalId\":263599,\"journal\":{\"name\":\"DAC Design Automation Conference 2012\",\"volume\":\"317 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DAC Design Automation Conference 2012\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2228360.2228471\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DAC Design Automation Conference 2012","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2228360.2228471","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

考虑多层避障直线斯坦纳最小树(OARSMT)问题，提出了一种将多层实例转化为三维实例的约简方法。在此基础上，我们应用计算几何技术开发一个有效的算法，利用现有的OARSMT启发式。实验结果表明，我们的算法提供了一个高质量的解，并且与之前已知的结果相比有显著的加速。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An efficient algorithm for multi-layer obstacle-avoiding rectilinear Steiner tree construction

We consider the multi-layer obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) problem and propose a reduction to transform a multi-layer instance into a 3D instance. Based on the reduction we apply computational geometry techniques to develop an efficient algorithm, utilizing existing OARSMT heuristics. Experimental results show that our algorithm provides a solution with excellent quality and has a significant speed-up compared to previously known results.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

DAC Design Automation Conference 2012

自引率

0.00%

发文量