On parameterized approximation algorithms for balanced clustering
From MaRDI portal
Publication:2111529
Recommendations
- Faster balanced clusterings in high dimension
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
- Sublinear‐time approximation algorithms for clustering via random sampling
- Automata, Languages and Programming
Cites work
- scientific article; zbMATH DE number 7561535 (Why is no real title available?)
- A birthday repetition theorem and complexity of approximating dense CSPs
- A constant FPT approximation algorithm for hard-capacitated \(k\)-means
- A unified framework of FPT approximation algorithms for clustering problems
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- An LP-based \(k\)-means algorithm for balancing weighted point sets
- Approximating \(k\)-median via pseudo-approximation
- Approximating capacitated \(k\)-median with \((1 + \epsilon)k\) open facilities
- Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- Constant approximation for capacitated \(k\)-median with \((1+\epsilon)\)-capacity violation
- Constant-Factor FPT Approximation for Capacitated k-Median
- Distributed balanced partitioning via linear embedding
- Faster balanced clusterings in high dimension
- Greedy Strikes Back: Improved Facility Location Algorithms
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- On the fixed-parameter tractability of capacitated clustering
- On uniform capacitated \(k\)-median beyond the natural LP relaxation
Cited in
(3)
This page was built for publication: On parameterized approximation algorithms for balanced clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111529)
