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]
@inproceedings{ClementiIMLRS05, title = {Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances}, author = {Andrea E. F. Clementi and Miriam Di Ianni and Angelo Monti and Massimo Lauria and Gianluca Rossi and Riccardo Silvestri}, year = {2005}, doi = {10.1007/11429647_9}, url = {http://dx.doi.org/10.1007/11429647_9}, researchr = {https://researchr.org/publication/ClementiIMLRS05}, cites = {0}, citedby = {0}, pages = {89-98}, booktitle = {Structural Information and Communication Complexity, 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings}, editor = {Andrzej Pelc and Michel Raynal}, volume = {3499}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-26052-8}, }