On the Size of Some Trees Embedded in ${\mathbb R}^d$ - Archive ouverte HAL Access content directly
Journal Articles Operations Research Letters Year : 2011

On the Size of Some Trees Embedded in ${\mathbb R}^d$

(1) , (1)
1

Abstract

We show that, for an Euclidean minimal k-insertion tree (EMITk), if the weight w of an edge e is its Euclidean length to the power of α, the sum on all edges of EMITk of their weights w(e) is O(n * k−α/d) in the worst case, where d is the dimension, for d ≥ 2 and 0 < α < d. We also analyze the expected size of EMITk and some stars, when points are evenly distributed inside the unit ball, for any α > 0.
Not file

Dates and versions

hal-00991081 , version 1 (14-05-2014)

Identifiers

Cite

Pedro Machado Manhães de Castro, Olivier Devillers. On the Size of Some Trees Embedded in ${\mathbb R}^d$. Operations Research Letters, 2011, 39, pp.44-48. ⟨10.1016/j.orl.2010.10.005⟩. ⟨hal-00991081⟩

Collections

INRIA INRIA2
94 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More