Research map / Learning theory and algorithms / Clustering
The Parameterized Complexity of Clustering Incomplete Data
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Add the covering number to the parameters alongside k and r | In-Clustering-Completion · Incomplete Boolean vectors | parameterized complexity: paraNP-c -> FPT | Helped |
| Add the covering number to the parameters alongside k and r | Any-Clustering-Completion · Incomplete Boolean vectors | parameterized complexity: paraNP-c -> FPT | Helped |
| Add the covering number to the parameters alongside k and r | Diam-Clustering-Completion · Incomplete Boolean vectors | parameterized complexity: paraNP-c -> FPT | Helped |
| Use k+r as the parameterization | In-Clustering · Complete data | parameterized complexity: W[2]-c -> FPT | Helped |
| Use k+r as the parameterization | Any-Clustering and Diam-Clustering · Complete data | parameterized complexity: paraNP-c -> FPT | Helped |
| Omit the covering number and parameterize incomplete-data clustering by k+r alone | In-Clustering-Completion, Any-Clustering-Completion, and Diam-Clustering-Completion · Incomplete data | parameterized complexity: FPT -> paraNP-c | Hurt |
Closest papers by meaning
- Improved Fixed-Parameter Bounds for Min-Sum-Radii and Diameters k-Clustering and Their Fair Variants (AAAI 2025 · similarity 0.85)
- Parameterized Approximation Schemes for Fair-Range Clustering (NeurIPS 2024 · similarity 0.85)
- Competitively Consistent Clustering (ICML 2025 · similarity 0.84)
- Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling (NeurIPS 2026 · similarity 0.84)
- Parameterized Approximation Algorithms for Sum of Radii Clustering and Variants (AAAI 2024 · similarity 0.84)
- New Bounds on the Cohesion of Complete-link and Other Linkage Methods for Agglomerative Clustering (ICML 2024 · similarity 0.83)
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.