Clustering under Constraints: Efficient Parameterized Approximation Schemes
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911429191270400 |
|---|---|
| author | Bhore, Sujoy Gadekar, Ameet Inamdar, Tanmay |
| author_facet | Bhore, Sujoy Gadekar, Ameet Inamdar, Tanmay |
| contents | We present a unified framework that yields EPASes for constrained $(k,z)$-clustering in metric spaces of bounded (algorithmic) scatter dimension, a notion introduced by Abbasi et al. (FOCS 2023). They showed that several well known metric families, including continuous Euclidean spaces, bounded doubling spaces, planar metrics, and bounded treewidth metrics, have bounded scatter dimension. Subsequently, Bourneuf and Pilipczuk (SODA 2025) proved that this also holds for metrics induced by graphs from any fixed proper minor closed class. Our result, in particular, addresses a major open question of Abbasi et al., whose approach to $k$-clustering in such metrics was inherently limited to \emph{Voronoi-based} objectives, where each point is connected only to its nearest chosen center.
As a consequence, we obtain EPASes for several constrained clustering problems, including capacitated and matroid $(k,z)$-clustering, fault tolerant and fair $(k,z)$-clustering, as well as for metrics of bounded highway dimension. In particular, our results on capacitated and fair $k$-Median and $k$-Means provide the first EPASes for these problems across broad families of structured metrics. Previously, such results were known only in continuous Euclidean spaces, due to the works of Cohen-Addad and Li (ICALP 2019) and Bandyapadhyay, Fomin, and Simonov (ICALP 2021; JCSS 2024), respectively. Along the way, we also obtain faster EPASes for uncapacitated $k$-Median and $k$-Means, improving upon the running time of the algorithm by Abbasi et al. (FOCS 2023). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_06980 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Clustering under Constraints: Efficient Parameterized Approximation Schemes Bhore, Sujoy Gadekar, Ameet Inamdar, Tanmay Data Structures and Algorithms We present a unified framework that yields EPASes for constrained $(k,z)$-clustering in metric spaces of bounded (algorithmic) scatter dimension, a notion introduced by Abbasi et al. (FOCS 2023). They showed that several well known metric families, including continuous Euclidean spaces, bounded doubling spaces, planar metrics, and bounded treewidth metrics, have bounded scatter dimension. Subsequently, Bourneuf and Pilipczuk (SODA 2025) proved that this also holds for metrics induced by graphs from any fixed proper minor closed class. Our result, in particular, addresses a major open question of Abbasi et al., whose approach to $k$-clustering in such metrics was inherently limited to \emph{Voronoi-based} objectives, where each point is connected only to its nearest chosen center. As a consequence, we obtain EPASes for several constrained clustering problems, including capacitated and matroid $(k,z)$-clustering, fault tolerant and fair $(k,z)$-clustering, as well as for metrics of bounded highway dimension. In particular, our results on capacitated and fair $k$-Median and $k$-Means provide the first EPASes for these problems across broad families of structured metrics. Previously, such results were known only in continuous Euclidean spaces, due to the works of Cohen-Addad and Li (ICALP 2019) and Bandyapadhyay, Fomin, and Simonov (ICALP 2021; JCSS 2024), respectively. Along the way, we also obtain faster EPASes for uncapacitated $k$-Median and $k$-Means, improving upon the running time of the algorithm by Abbasi et al. (FOCS 2023). |
| title | Clustering under Constraints: Efficient Parameterized Approximation Schemes |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2504.06980 |