On parameterized approximation algorithms for balanced clustering

DOI10.1007/s10878-022-00980-wOpenAlexW4313715559MaRDI QIDQ2111529

Zhen Zhang, Qilong Feng, Xiangyan Kong

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

zbMATH Keywords

clusteringapproximation algorithmparameterized algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An LP-based \(k\)-means algorithm for balancing weighted point sets
• Distributed balanced partitioning via linear embedding
• Faster balanced clusterings in high dimension
• Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
• A constant FPT approximation algorithm for hard-capacitated \(k\)-means
• Approximating $k$-Median via Pseudo-Approximation
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• Greedy Strikes Back: Improved Facility Location Algorithms
• Approximating capacitated k-median with (1 + ∊)k open facilities
• An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
• On Uniform Capacitated k -Median Beyond the Natural LP Relaxation
• Constant-Factor FPT Approximation for Capacitated k-Median
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
• A unified framework of FPT approximation algorithms for clustering problems

This page was built for publication: On parameterized approximation algorithms for balanced clustering