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

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 87; no. 8; pp. 1178 - 1198
Main Authors:	Jaiswal, Ragesh, Kumar, Amit
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2025
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!