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

Browse the full SIROCCO paper archive.