Co-Clustering Under the Maximum Norm

DOI10.1007/978-3-319-13075-0_24zbMath1432.68171arXiv1512.05693OpenAlexW3197501982MaRDI QIDQ2942637

Sepp Hartung, Rolf Niedermeier, Vincent Froese, Laurent Bulteau

Publication date: 11 September 2015

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.05693

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)

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Co-Clustering Under the Maximum Norm