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

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!