Bulteau, LaurentFroese, VincentHartung, SeppNiedermeier, Rolf2019-08-012019-08-012016-02-25https://depositonce.tu-berlin.de/handle/11303/9686http://dx.doi.org/10.14279/depositonce-8726Co-clustering, that is partitioning a numerical matrix into “homogeneous” submatrices, has many applications ranging from bioinformatics to election analysis. Many interesting variants of co-clustering are NP-hard. We focus on the basic variant of co-clustering where the homogeneity of a submatrix is defined in terms of minimizing the maximum distance between two entries. In this context, we spot several NP-hard, as well as a number of relevant polynomial-time solvable special cases, thus charting the border of tractability for this challenging data clustering problem. For instance, we provide polynomial-time solvability when having to partition the rows and columns into two subsets each (meaning that one obtains four submatrices). When partitioning rows and columns into three subsets each, however, we encounter NP-hardness, even for input matrices containing only values from {0, 1, 2}.en004 Datenverarbeitung; Informatikbi-clusteringmatrix partitioningNP-hardnessSAT solvingfixed-parameter tractabilityArticle2019-07-231999-4893