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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 87; H. 8; S. 1178 - 1198
Hauptverfasser:	Jaiswal, Ragesh, Kumar, Amit
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.08.2025
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!