1. Lossy Kernelization of Same-Size Clustering.
- Author
-
Bandyapadhyay, Sayan, Fomin, Fedor V., Golovach, Petr A., Purohit, Nidhi, and Simonov, Kirill
- Subjects
- *
POLYNOMIALS , *COST - Abstract
In this work, we study the k-median clustering problem with an additional equal-size constraint on the clusters from the perspective of parameterized preprocessing. Our main result is the first lossy (2-approximate) polynomial kernel for this problem parameterized by the cost of clustering. We complement this result by establishing lower bounds for the problem that eliminate the existence of an (exact) kernel of polynomial size and a PTAS. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF