Research map / Learning theory and algorithms / Clustering
Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost
Read the paperCheck 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
- Learning-Augmented Streaming Algorithms for Correlation Clustering (NeurIPS 2025 · similarity 0.94)
- Estimating Correlation Clustering Cost in Node-Arrival Stream (ICML 2026 · similarity 0.93)
- Dynamic Correlation Clustering in Sublinear Update Time (ICML 2024 · similarity 0.89)
- New Parallel and Streaming Algorithms for Directed Densest Subgraph (NeurIPS 2025 · similarity 0.88)
- Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs (ICML 2024 · similarity 0.87)
- Efficient Streaming Algorithms for Graphlet Sampling (NeurIPS 2024 · similarity 0.86)
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.