Approximation Schemes for Capacitated Clustering in Doubling Metrics
From MaRDI portal
Publication:5146927
DOI10.1137/1.9781611975994.138OpenAlexW3001164300MaRDI QIDQ5146927
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
Related Items (10)
An improved approximation algorithm for capacitated correlation clustering problem ⋮ Approximation algorithm for the capacitated correlation clustering problem with penalties ⋮ Approximation algorithms for the individually fair \(k\)-center with outliers ⋮ On coresets for fair clustering in metric and Euclidean spaces and their applications ⋮ Approximation algorithms for fair \(k\)-median problem without fairness violation ⋮ A constant FPT approximation algorithm for hard-capacitated \(k\)-means ⋮ Lossy kernelization of same-size clustering ⋮ Unnamed Item ⋮ Lossy kernelization of same-size clustering ⋮ Approximation algorithms for the capacitated correlation clustering problem with penalties
This page was built for publication: Approximation Schemes for Capacitated Clustering in Doubling Metrics
