On the asymptotic growth rate of some spanning trees embedded in Rd

Operations Research Letters（2011）

引用 3|浏览0

暂无评分

摘要

We show that, for an Euclidean minimal k-insertion tree (EMIT"k) with n vertices, if the weight w of an edge e is its Euclidean length to the power of @a, @?"e"@?"E"M"I"T"""kw(e) is O(n@?k^-^@a^/^d) in the worst case, where d is the dimension, for d=2 and 00.

查看译文

关键词

n vertex,edge e,weight w,asymptotic growth rate,euclidean minimal k-insertion tree,euclidean length,geometric graphs,worst case,spanning trees,point location,geometric graph,spanning tree,unit ball

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要