| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Connected k-Center and k-Diameter Clustering | Drexler, Lukas et al. | 2023 |
| 2 | Achieving Anonymity via Weak Lower Bound Constraints for k-Median and k-Means | Arutyunova, Anna et al. | 2021 |
| 3 | Upper and Lower Bounds for Complete Linkage in General Metric Spaces | Arutyunova, Anna et al. | 2021 |
| 4 | Noisy, Greedy and Not so Greedy k-Means++ | Bhattacharya, Anup et al. | 2020 |
| 5 | On the Cost of Essentially Fair Clusterings | Bercea, Ioana O. et al. | 2019 |
| 6 | A Local-Search Algorithm for Steiner Forest | Groß, Martin et al. | 2018 |
| 7 | Privacy Preserving Clustering with Constraints | Rösner, Clemens et al. | 2018 |
| 8 | Approximation Algorithms for Aversion k-Clustering via Local k-Median | Gupta, Anupam et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |