Worst-case growth rates of some classical problems of combinatorial optimization
SIAM Journal on Computing
Worst case asymptotics of power-weighted Euclidean functionals
Discrete Mathematics
Cost of sequential connection for points in space
Operations Research Letters
Practical distribution-sensitive point location in triangulations
Computer Aided Geometric Design
| Hi-index | 0.00 |
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.