On minimal rectilinear Steiner trees in all dimensions

SCG '90 Pub Date : 1990-05-01 DOI:10.1145/98524.98596
T. Snyder
{"title":"On minimal rectilinear Steiner trees in all dimensions","authors":"T. Snyder","doi":"10.1145/98524.98596","DOIUrl":null,"url":null,"abstract":"It is proved that the length of the longest possible minimum rectilinear Steiner tree of <italic>n</italic> points in the unit <italic>d</italic>-cube is asymptotic to Β<subscrpt><italic>d</subscrpt>n</italic> d-1/d, where Β<subscrpt><italic>d</italic></subscrpt>. In addition to replicating Chung and Graham's exact determination of Β<subscrpt>2</subscrpt> = 1, this generalization yields tight new bounds such as 1 ≤ Β<subscrpt>3</subscrpt> < 1.191 and 1 < Β<subscrpt>4</subscrpt> < √<italic>2</italic>.","PeriodicalId":113850,"journal":{"name":"SCG '90","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SCG '90","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/98524.98596","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

It is proved that the length of the longest possible minimum rectilinear Steiner tree of n points in the unit d-cube is asymptotic to Βdn d-1/d, where Βd. In addition to replicating Chung and Graham's exact determination of Β2 = 1, this generalization yields tight new bounds such as 1 ≤ Β3 < 1.191 and 1 < Β4 < √2.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在所有维的最小线性斯坦纳树上
证明了单位d立方上n个点的最长可能最小线性斯坦纳树的长度渐近于Βdn d-1/d,其中Βd。除了复制Chung和Graham对Β2 = 1的精确判断外,这种推广还产生了紧密的新界限,例如1≤Β3 < 1.191和1 < Β4 <√2。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Linear programming and convex hulls made easy Computing the minimum Hausdorff distance for point sets under translation On solving geometric optimization problems using shortest paths Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams An O(n2log n) time algorithm for the MinMax angle triangulation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1