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 Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. 89-98 2005 conf/sirocco/2005 SIROCCO http://dx.doi.org/10.1007/11429647_9 db/conf/sirocco/sirocco2005.html#ClementiIMLRS05