Approximation Schemes for Capacitated Clustering in Doubling Metrics

DOI10.1137/1.9781611975994.138MaRDI QIDQ5146927zbMATH OpenOpenAlexFDO

Authors Vincent Cohen-Addad

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.07721

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Near-linear Time Approximation Schemes for Clustering in Doubling Metrics
• Approximation schemes for clustering problems
• Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
• On the fixed-parameter tractability of capacitated clustering
• A matheuristic for large-scale capacitated clustering
• Approximation algorithms for the capacitated correlation clustering problem with penalties
• An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
• Approximating min-sum k -clustering in metric spaces
• Approximation algorithm for the capacitated correlation clustering problem with penalties

Cited in

(15)

• Lossy kernelization of same-size clustering
• Approximation algorithms for the capacitated correlation clustering problem with penalties
• An improved approximation algorithm for capacitated correlation clustering problem
• Approximation algorithm for the capacitated correlation clustering problem with penalties
• A constant FPT approximation algorithm for hard-capacitated \(k\)-means
• On the fixed-parameter tractability of capacitated clustering
• Approximation algorithms for the individually fair k-center with outliers
• On coresets for fair clustering in metric and Euclidean spaces and their applications
• Lossy kernelization of same-size clustering
• Approximation algorithms for fair k-median problem without fairness violation
• A PTAS framework for clustering problems in doubling metrics
• FPT approximation for capacitated clustering with outliers
• Improved approximation algorithm for individual fairness k-median
• Better guarantees for individual fairness k-median
• On coresets for fair clustering in metric and Euclidean spaces and their applications

This page was built for publication: Approximation Schemes for Capacitated Clustering in Doubling Metrics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146927)