{"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}
引用次数: 0
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.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
