Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Andrea E. F. Clementi' in GoogleThis author has not been identified. Look up 'Miriam Di Ianni' in GoogleThis author has not been identified. Look up 'Angelo Monti' in GoogleThis author has not been identified. Look up 'Massimo Lauria' in GoogleThis author has not been identified. Look up 'Gianluca Rossi' in GoogleThis author has not been identified. Look up 'Riccardo Silvestri' in Google

runs on WebDSL