Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142583 | Operations Research Letters | 2011 | 5 Pages |
Abstract
We show that, for an Euclidean minimal k-insertion tree (EMITk) with n vertices, if the weight w of an edge e is its Euclidean length to the power of α, âeâEMITkw(e) is O(nâ
kâα/d) in the worst case, where d is the dimension, for dâ¥2 and 0<α0.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Pedro M.M. de Castro, Olivier Devillers,