Login / Signup
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances.
Andrea E. F. Clementi
Miriam Di Ianni
Angelo Monti
Massimo Lauria
Gianluca Rossi
Riccardo Silvestri
Published in:
SIROCCO (2005)
Keyphrases
</>
randomly generated
asymptotically optimal
dynamic programming
training instances
optimal solution
worst case
euclidean distance
closed form
euclidean space
optimal control
random instances