Co-clustering under the maximum norm

DOI10.3390/a9010017zbMath1432.68172OpenAlexW2138629073MaRDI QIDQ1736769

Vincent Froese, Sepp Hartung, Laurent Bulteau, Rolf Niedermeier

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a9010017

zbMATH Keywords

NP-hardnessmatrix partitioningfixed-parameter tractabilitySAT-solvingbi-clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Factorization of matrices (15A23) Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Parameterized \(k\)-clustering: tractability island

Uses Software

• PicoSAT

Cites Work

• Fundamentals of parameterized complexity
• Optimal packing and covering in the plane are NP-complete
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Approximation Algorithms for Tensor Clustering
• Approximate Boolean Reasoning: Foundations and Applications in Data Mining
• Parameterized Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Co-clustering under the maximum norm