欧几里得斯坦纳最小树的一种更好的启发式

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science Pub Date : 1991-09-01 DOI:10.1109/SFCS.1991.185402

D. Du, Yanjun Zhang, Qing Feng

{"title":"欧几里得斯坦纳最小树的一种更好的启发式","authors":"D. Du, Yanjun Zhang, Qing Feng","doi":"10.1109/SFCS.1991.185402","DOIUrl":null,"url":null,"abstract":"Finding a shortest network interconnecting a given set of points in the Euclidean plane (a Steiner minimum tree) is known to be NP-hard. It is shown that there exists a polynomial-time heuristic with a performance ratio bigger than square root 3/2.<<ETX>>","PeriodicalId":320781,"journal":{"name":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"71","resultStr":"{\"title\":\"On better heuristic for Euclidean Steiner minimum trees\",\"authors\":\"D. Du, Yanjun Zhang, Qing Feng\",\"doi\":\"10.1109/SFCS.1991.185402\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Finding a shortest network interconnecting a given set of points in the Euclidean plane (a Steiner minimum tree) is known to be NP-hard. It is shown that there exists a polynomial-time heuristic with a performance ratio bigger than square root 3/2.<<ETX>>\",\"PeriodicalId\":320781,\"journal\":{\"name\":\"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"71\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1991.185402\",\"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 32nd Annual Symposium of Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1991.185402","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 71

摘要

在欧几里得平面(一个斯坦纳最小树)上找到一个最短的连接给定点的网络是np困难的。结果表明，存在一个性能比大于根号3/2的多项式时间启发式算法

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

查看原文本刊更多论文

On better heuristic for Euclidean Steiner minimum trees

Finding a shortest network interconnecting a given set of points in the Euclidean plane (a Steiner minimum tree) is known to be NP-hard. It is shown that there exists a polynomial-time heuristic with a performance ratio bigger than square root 3/2.<>

求助全文

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

来源期刊

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science

自引率

0.00%

发文量