Constant-Round Massively Parallel Algorithms for Approximate MSTs in Metric Spaces
cs.DS, cs.CG, cs.DC
Submitted: 2026-11-04
Updated: 2026-11-04
Terminology
Sources
- Geometric Hashing in MPC with Applications to Clustering and Stochastic Embeddings
- Streaming Facility Location in High Dimension via Geometric Hashing
- Fully Scalable MPC Algorithms for Euclidean Clustering: Constant Approximation in Constant Rounds
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time