Co-Clustering under the Maximum Norm

Co-Clustering under the Maximum Norm

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

Full description

Bibliographic Details
Main Authors: Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
Format: Article
Language:English
Published: MDPI AG 2016-02-01
Series:Algorithms
Subjects:
bi-clustering
matrix partitioning
NP-hardness
SAT solving
fixed-parameter tractability
Online Access:http://www.mdpi.com/1999-4893/9/1/17

Internet

http://www.mdpi.com/1999-4893/9/1/17

Similar Items