On parameterized approximation algorithms for balanced clustering
From MaRDI portal
Publication:2111529
DOI10.1007/S10878-022-00980-WOpenAlexW4313715559MaRDI QIDQ2111529FDOQ2111529
Authors: Xiangyan Kong, Zhen Zhang, Qilong Feng 
Publication date: 17 January 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00980-w
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Greedy Strikes Back: Improved Facility Location Algorithms
- Approximating \(k\)-median via pseudo-approximation
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- A unified framework of FPT approximation algorithms for clustering problems
- On the fixed-parameter tractability of capacitated clustering
- Constant approximation for capacitated \(k\)-median with \((1+\epsilon)\)-capacity violation
- On uniform capacitated \(k\)-median beyond the natural LP relaxation
- Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
- An LP-based \(k\)-means algorithm for balancing weighted point sets
- Approximating capacitated \(k\)-median with \((1 + \epsilon)k\) open facilities
- Faster balanced clusterings in high dimension
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- A birthday repetition theorem and complexity of approximating dense CSPs
- Distributed balanced partitioning via linear embedding
- Title not available (Why is that?)
- A constant FPT approximation algorithm for hard-capacitated \(k\)-means
- Constant-Factor FPT Approximation for Capacitated k-Median
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)
