Massively parallel algorithms for high-dimensional Euclidean minimum spanning tree

DOI10.1137/1.9781611977912.139MaRDI QIDQ6645505zbMATH OpenFDO

Authors Rajesh Jayaram, Vahab S. Mirrokni, Shyam Narayanan, Peilin Zhong

Publication date 28 November 2024

Full work available at URL https://doi.org/10.1137/1.9781611977912.139

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Fully-scalable MPC algorithms for clustering in high dimension
• Fully scalable MPC algorithms for Euclidean k-center

This page was built for publication: Massively parallel algorithms for high-dimensional Euclidean minimum spanning tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645505)