Elsevier, Operations Research Letters, 1(39), p. 44-48
DOI: 10.1016/j.orl.2010.10.005
Full text: Unavailable
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 0.