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. In Andrzej Pelc, Michel Raynal, editors, Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings. Volume 3499 of Lecture Notes in Computer Science, pages 89-98, Springer, 2005. [doi]
Abstract is missing.