Research map / Learning theory and algorithms / Clustering
RAMA: A Rapid Multicut Algorithm on GPU
Check your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- ClusterFuG: Clustering Fully connected Graphs by Multicut (ICML 2023 · similarity 0.88)
- Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth (NeurIPS 2022 · similarity 0.86)
- Correlation Clustering in Constant Many Parallel Rounds (ICML 2021 · similarity 0.86)
- Memory-Efficient Approximation Algorithms for Max-k-Cut and Correlation Clustering (NeurIPS 2021 · similarity 0.85)
- Dynamic Correlation Clustering in Sublinear Update Time (ICML 2024 · similarity 0.84)
- New Parallel and Streaming Algorithms for Directed Densest Subgraph (NeurIPS 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.