线性Steiner问题的次优算法

China., 1991 International Conference on Circuits and Systems Pub Date : 1991-06-16 DOI:10.1109/CICCAS.1991.184499

Yubo Ji, Meilun Liu

{"title":"线性Steiner问题的次优算法","authors":"Yubo Ji, Meilun Liu","doi":"10.1109/CICCAS.1991.184499","DOIUrl":null,"url":null,"abstract":"The new algorithm does not construct a Steiner tree as the result in one time, but first gets simply an initial tree and then concentrates on refining it. The time complexity and space complexity of the algorithm is low and the percentage of reduction in suboptimal Steiner tree length over minimum spanning tree length is high.<<ETX>>","PeriodicalId":119051,"journal":{"name":"China., 1991 International Conference on Circuits and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A suboptimal algorithm for rectilinear Steiner problem\",\"authors\":\"Yubo Ji, Meilun Liu\",\"doi\":\"10.1109/CICCAS.1991.184499\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The new algorithm does not construct a Steiner tree as the result in one time, but first gets simply an initial tree and then concentrates on refining it. The time complexity and space complexity of the algorithm is low and the percentage of reduction in suboptimal Steiner tree length over minimum spanning tree length is high.<<ETX>>\",\"PeriodicalId\":119051,\"journal\":{\"name\":\"China., 1991 International Conference on Circuits and Systems\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"China., 1991 International Conference on Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CICCAS.1991.184499\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"China., 1991 International Conference on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICCAS.1991.184499","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

新算法并没有一次性构造出一棵斯坦纳树作为结果，而是先得到一棵简单的初始树，然后集中精力对其进行细化。该算法的时间复杂度和空间复杂度较低，次优斯坦纳树长度比最小生成树长度减少的百分比较高。

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

查看原文本刊更多论文

A suboptimal algorithm for rectilinear Steiner problem

The new algorithm does not construct a Steiner tree as the result in one time, but first gets simply an initial tree and then concentrates on refining it. The time complexity and space complexity of the algorithm is low and the percentage of reduction in suboptimal Steiner tree length over minimum spanning tree length is high.<>

求助全文

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

来源期刊

China., 1991 International Conference on Circuits and Systems

自引率

0.00%

发文量