Research map / Learning theory and algorithms / Clustering
Augmented Sparsifiers for Generalized Hypergraph Cuts
Nate Veldt, Austin R. Benson, Jon Kleinberg
Read the paperCheck your idea against 137,217 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 on Hypergraphs with Sparsity (TPAMI 2020 · similarity 0.89)
- Inhomogeneous Hypergraph Clustering with Applications (NeurIPS 2017 · similarity 0.88)
- Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges (ICML 2025 · similarity 0.88)
- Quantum Speedup for Hypergraph Sparsification (ICML 2025 · similarity 0.87)
- A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering (ICML 2024 · similarity 0.87)
- Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition (ICML 2025 · 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.
