Parameterized complexity of categorical clustering with size constraints

In the Categorical Clustering problem, we are given a set of vectors (matrix) A={a1,…,an} over Σm, where Σ is a finite alphabet, and integers k and B. The task is to partition A into k clusters such that the median objective of the clustering in the Hamming norm is at most B. Fomin, Golovach, and Pa...

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 136; pp. 171 - 194
Main Authors:	Fomin, Fedor V., Golovach, Petr A., Purohit, Nidhi
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.09.2023
Subjects:	Categorical clustering Fixed-parameterized algorithm k-median Kernelization k-median Fixed-parameterized algorithm Categorical clustering Kernelization
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!