Clustering What Matters in Constrained Settings Improved Outlier to Outlier-Free Reductions

Constrained clustering problems generalize classical clustering formulations, e.g., k -median , k -means , by imposing additional constraints on the feasibility of a clustering. There has been significant recent progress in obtaining approximation algorithms for these problems, both in the metric an...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithmica Ročník 87; číslo 8; s. 1178 - 1198
Hlavní autoři: Jaiswal, Ragesh, Kumar, Amit
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.08.2025
Témata:
Algorithm Analysis and Problem Complexity
Algorithms
Computer Science
Computer Systems Organization and Communication Networks
Data Structures and Information Theory
Mathematics of Computing
Theory of Computation
Outlier
Theory of computation
Constrained
Clustering
Facility location and clustering
ISSN:0178-4617, 1432-0541
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Constrained clustering problems generalize classical clustering formulations, e.g., k -median , k -means , by imposing additional constraints on the feasibility of a clustering. There has been significant recent progress in obtaining approximation algorithms for these problems, both in the metric and the Euclidean settings. However, the outlier version of these problems, where the solution is allowed to leave out m points from the clustering, is not well understood. In this work, we give a general framework for reducing the outlier version of a constrained k -median or k -means problem to the corresponding outlier-free version with only ( 1 + ε ) -loss in the approximation ratio. The reduction is obtained by mapping the original instance of the problem to f ( k , m , ε ) instances of the outlier-free version, where f ( k , m , ε ) = k + m ε O ( m ) . As specific applications, we get the following results: First FPT ( in the parameters k and m ) ( 1 + ε ) -approximation algorithm for the outlier version of capacitated k -median and k -means in Euclidean spaces with hard capacities. First FPT ( in the parameters k and m ) ( 3 + ε ) and ( 9 + ε ) approximation algorithms for the outlier version of capacitated k -median and k -means , respectively, in general metric spaces with hard capacities. First FPT ( in the parameters k and m ) ( 2 - δ ) -approximation algorithm for the outlier version of the k -median problem under the Ulam metric. Our work generalizes the results of Bhattacharya et al. and Agrawal et al. to a larger class of constrained clustering problems. Further, our reduction works for arbitrary metric spaces and so can extend clustering algorithms for outlier-free versions in both Euclidean and arbitrary metric spaces.
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-025-01317-9